Results 1 
2 of
2
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.
Batching in a twostage flowshop with dedicated machines in the second stage
 IIE Transactions
, 2004
"... The problem of batching and scheduling n identical jobs of F, F ≥ 2, part types in a shop made up of F + 1 machines is studied. The processing of each job comprises two stages. The first stage is undertaken on the machine common to all jobs and the second stage is undertaken on the machine specific ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The problem of batching and scheduling n identical jobs of F, F ≥ 2, part types in a shop made up of F + 1 machines is studied. The processing of each job comprises two stages. The first stage is undertaken on the machine common to all jobs and the second stage is undertaken on the machine specific to a particular part type. Setup times are necessary at the first stage to switch processing from a job of one part type to a job of another part type. Jobs of the same part type processed contiguously at the first stage form a batch. The objective is to find a batch schedule minimizing makespan. We show that this problem is equivalent to a special case of a single machine family scheduling problem to minimize maximum lateness and, therefore, it can be solved in O(nF) time by a known algorithm. Furthermore, for the case F = 2, we present an iterative exact algorithm with O(k0 logL) running time, where k0 is the maximum number of batches in a schedule created in any iteration of the algorithm and L is the problem input length in unary encoding. The algorithm finds a schedule with the minimum number of batches k ∗ in any optimal solution. Computational experiments were conducted to investigate the relationship between k ∗ and k0. For all tested examples, k0 = max{k∗1, k∗2}, where k∗1 (k∗2) was the minimum number of batches in any optimal schedule starting with a batch of one part type (the other part type).