Results 1 
4 of
4
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.
unknown title
"... Abstract—We consider a typical problem in the assembly of printed circuit boards (PCBs) in a twomachine flow shop system to simultaneously minimize the weighted sum of weighted tardiness and weighted flow time. The investigated problem is a group scheduling problem in which PCBs are assembled in gr ..."
Abstract
 Add to MetaCart
Abstract—We consider a typical problem in the assembly of printed circuit boards (PCBs) in a twomachine flow shop system to simultaneously minimize the weighted sum of weighted tardiness and weighted flow time. The investigated problem is a group scheduling problem in which PCBs are assembled in groups and the interest is to find the best sequence of groups as well as the boards within each group to minimize the objective function value. The type of setup operation between any two board groups is characterized as carryover sequencedependent setup time, which exactly matches with the real application of this problem. As a technical constraint, all of the boards must be kitted before the assembly operation starts (kitting operation) and by kitting staff. The main idea developed in this paper is to completely eliminate the role of kitting staff by assigning the task of kitting to the machine operator during the time he is idle which is referred to as integration of internal (machine) and external (kitting) setup times. Performing the kitting operation, which is a preparation process of the next set of boards while the other boards are currently being assembled, results in the boards to continuously enter the system or have dynamic arrival times. Consequently, a dynamic PCB assembly system is introduced for the first time in the assembly of PCBs, which also has characteristics similar to that of justintime manufacturing. The problem investigated is computationally very complex, meaning that finding the optimal solutions especially when the problem size gets larger is impossible. Thus, a heuristic based on Genetic Algorithm (GA) is employed. An example problem on the application of the GA developed is demonstrated and also numerical results of applying the GA on solving several instances are provided. Keywords—Genetic algorithm, Dynamic PCB assembly, Carryover sequencedependent setup times, Multiobjective. I.
machine problem with setup
"... Scheduling rules to minimize total tardiness in a parallel ..."
(Show Context)
Elsevier
, 2010
"... Document downloaded from: This paper must be cited as: The final publication is available at Copyright ..."
Abstract
 Add to MetaCart
Document downloaded from: This paper must be cited as: The final publication is available at Copyright