Results 1  10
of
82
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.
Approximation Algorithms for DeadlineTSP and Vehicle Routing with TimeWindows
 STOC'04
, 2004
"... ..."
(Show Context)
Flowshopscheduling problems with makespan criterion: a review
, 2005
"... This paper is a complete survey of flowshopscheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), construc ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
(Show Context)
This paper is a complete survey of flowshopscheduling problems and contributions from early works of Johnson of 1954 to recent approaches of metaheuristics of 2004. It mainly considers a flowshop problem with a makespan criterion and it surveys some exact methods (for small size problems), constructive heuristics and developed improving metaheuristic and evolutionary approaches as well as some wellknown properties and rules for this problem. Each part has a brief literature review of the contributions and a glimpse of that approach before discussing the implementation for a flowshop problem. Moreover, in the first section, a complete literature review of flowshoprelated scheduling problems with different assumptions as well as contributions in solving these other aspects is considered. This paper can be seen as a reference to past contributions (particularly in n/m/ p/c max or equivalently F/prmu/c max) for future research needs of improving and developing better approaches to flowshoprelated scheduling problems.
Competitive online scheduling of perfectly malleable jobs with setup times
 European Journal of Operational Research
"... Abstract We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m ≥ 2 processors. We take into account both the linear speedup of such jobs and their setup time, i.e., the time to create, dispatch, and destroy multiple processes. Specifically, ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m ≥ 2 processors. We take into account both the linear speedup of such jobs and their setup time, i.e., the time to create, dispatch, and destroy multiple processes. Specifically, we define the execution time of a job with length p j running on k j processors to be p j /k j +(k j −1)c, where c > 0 is a constant setup time associated with each processor that is used to parallelize the computation. This formulation accurately models data parallelism in scientific computations and realistically asserts a relationship between job length and the maximum useful degree of parallelism. When the goal is to minimize makespan, we show that the online algorithm that simply assigns k j so that the execution time of each job is minimized and starts jobs as early as possible has competitive ratio 4(m − 1)/m for even m ≥ 2 and 4m/(m + 1) for odd m ≥ 3. This algorithm is much simpler than previous offline algorithms for scheduling malleable jobs that require more than a constant number of passes through the job list.
Singlemachine scheduling problems with pastsequencedependent setup times
 European Journal of Operational Research
"... This paper studies singlemachine scheduling problems with setup times which are proportionate to the length of the already scheduled jobs, that is, with pastsequencedependent or psd setup times. The following objective functions are considered: the maximum completion time (makespan), the total ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper studies singlemachine scheduling problems with setup times which are proportionate to the length of the already scheduled jobs, that is, with pastsequencedependent or psd setup times. The following objective functions are considered: the maximum completion time (makespan), the total completion time, the total absolute differences in completion times and a bicriteria combination of the last two objective functions. It is shown that the standard singlemachine scheduling problem with psd setup times and any of the above objective functions can be solved in O(nlogn) time (where n is the number of jobs) by a sorting procedure. It is also shown that all of our results extend to a ‘‘learning’ ’ environment in which the psd setup times are no longer linear functions of the already elapsed processing time due to learning effects.
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.
A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem
 International Journal of Operations Research
, 2007
"... AbstractIn this paper the NPhard single machine total weighted tardiness scheduling problem in presence of sequencedependent setup times is faced with a new Ant Colony Optimization (ACO) approach. The proposed ACO algorithm is based on a new global pheromone update mechanism, which makes the phero ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
AbstractIn this paper the NPhard single machine total weighted tardiness scheduling problem in presence of sequencedependent setup times is faced with a new Ant Colony Optimization (ACO) approach. The proposed ACO algorithm is based on a new global pheromone update mechanism, which makes the pheromone trails asymptotically range between two bounds arbitrarily fixed and the ACO learning mechanism independent of the values of the objective function of the considered problem. Other features of the algorithm include a diversification mechanism for the solution construction phase based on a local pheromone update rule whose effects are restricted to the single iterations, and a cumulative option for the global pheromone update rule. An experimental campaign, carried out on a benchmark available from the literature, was executed to evaluate the proposed ACO and the effectiveness of its optional features. In particular, the obtained results were compared with the ones of a recently proposed ACO algorithm for the same problem by Liao and Juan (2007). The analysis of the outcomes showed the competitiveness of the new ACO approach, which was able to improve about 72 % of the best known results for the benchmark. Finally, a further investigation on a different benchmark set of instances without setup times showed the robustness of the proposed ACO algorithm. KeywordsAnt colony optimization, Metaheuristics, Scheduling, Total weighted tardiness 1.
Production Planning Problem with Sequence Dependent Setups,
 Proceedings of 10th International Conference on Operational Research,
, 2004
"... Abstract Each of n products is to be processed on two machines in order to satisfy known demands in each of T periods. Only one product can be processed on each machine at any given time. Each switch from one item to another requires sequence dependent setup time. The objective is to minimize the t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract Each of n products is to be processed on two machines in order to satisfy known demands in each of T periods. Only one product can be processed on each machine at any given time. Each switch from one item to another requires sequence dependent setup time. The objective is to minimize the total setup time and the sum of the costs of production, storage and setup. We consider the problem as a bilevel mixed 01 integer programming problem. The objective of the leader is to assign the products to the machines in order to minimize the total sequence dependent setup time, while the objective of the follower is to minimize the production, storage and setup cost of the machine. We develop a heuristics based on tabu search for solving the problem. At the end, some computational results are presented.