Results 1 
5 of
5
A Survey of Scheduling Problems with Setup Times or Costs
"... The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setu ..."
Abstract

Cited by 104 (5 self)
 Add to MetaCart
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and nonbatching considerations, and with sequenceindependent and sequencedependent setup times. It further categorizes the literature according to shop environments, including singlemachine, parallel machines, flow shop, nowait flow shop, flexible flow shop, job shop, open shop, and others.
A Dynamic Heuristic for the Stochastic Unrelated Parallel Machine Scheduling Problem
 International Journal of Operations Research
, 2006
"... AbstractThis paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the total weighted mean completion time. The jobs’ processing times and setup times are stochastic for better depiction of the ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
AbstractThis paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the total weighted mean completion time. The jobs’ processing times and setup times are stochastic for better depiction of the real world. This is a NPhard problem and in this paper, new heuristics are developed and compared to existing ones using simulation. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm PMWP over the other algorithms presented.
Single Machine Scheduling with Resource Dependent Release Times and Processing Times
"... We consider the single machine scheduling problem with resource dependent release times and processing times, in which both the release times and processing times are strictly linear decreasing functions of the amount of resources consumed. The objective is to minimize the makespan plus the total re ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the single machine scheduling problem with resource dependent release times and processing times, in which both the release times and processing times are strictly linear decreasing functions of the amount of resources consumed. The objective is to minimize the makespan plus the total resource consumption costs. We propose a heuristic algorithm for the general problem by utilizing some derived optimal properties and analyze its performance bound. For some special cases, we propose another heuristic algorithm that achieves a tighter performance bound.
SequenceDependent Setup Times in a TwoMachine JobShop with Minimizing the Schedule Length
, 2006
"... AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractThis article addresses the jobshop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequencedependent setup times and removal times. The processing of each job includes at most two operations that have to be nonpreemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's permutations, otherwise it is NPhard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson’s permutations may be used for solving the twomachine jobshop problem with sequencedependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branchandbound algorithm. Computational experiments show that an exact solution for this problem may be obtained in a suitable time for n ≤ 280. We also develop a heuristic algorithm and present a worst case analysis. KeywordsScheduling theory, Setup, Jobshop 1.
Two Hybrid Algorithms for Solving the Multi Objective Batch Scheduling Problem on a Single Machine Based on Simulated Annealing and Clustering Methods
"... Single machine batching scheduling is one of the most important problems in the manufacturing area which has applied many applications especially in field of supply chain management. In the real world industry, the manufacturers require a suitable plan so as to deliver the finished items to their cu ..."
Abstract
 Add to MetaCart
Single machine batching scheduling is one of the most important problems in the manufacturing area which has applied many applications especially in field of supply chain management. In the real world industry, the manufacturers require a suitable plan so as to deliver the finished items to their customers with minimum delivery and tardiness cost. This paper studies the present problem with objective of minimizing the total tardiness and maximizing the job values on a single machine when the deteriorated jobs are delivered to each customer in various size batches and proposed a mathematical model for this target. Furthermore, all jobs are not ready for process at time zero and each job is ready based on a predefined release date. In order to solve the proposed model, two hybrid algorithms, based on simulated annealing and clustering methods are offered and the results are compared with the global optimums that are generated by Lingo 10 software. Furthermore, based on the effective factors of the problem, a number of sensitivity analyses are also implemented. Computational study demonstrates that using clustering methods leads to specified improvements in batching process.