Scheduling in flowshops to minimize total tardiness of jobs
01 Jun 2004-International Journal of Production Research (Taylor & Francis Group)-Vol. 42, Iss: 11, pp 2289-2301
TL;DR: The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.
Abstract: The problem of scheduling in static flowshops is considered with the objective of minimizing mean or total tardiness of jobs. A heuristic algorithm based on the simulated annealing (SA) technique is developed. The salient features of the proposed SA algorithm are the development of two new perturbation schemes for use in the proposed SA algorithm and a new improvement scheme to improve the quality of the solutions. The proposed algorithm is evaluated by using the benchmark problems available in the literature. The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics.
Citations
More filters
TL;DR: In this paper, an original optimization scatter search algorithm taking into consideration both technological and organizational restrictions was applied to the real analysis of the industrial building project realization, and the results showed that the algorithm was more efficient than the traditional scatter search.
Abstract: This work deals with the application of artificial intelligence instruments in a building schedule. In this article there was presented an original optimization scatter search algorithm taking into consideration both technological and organizational restrictions. This algorithm was applied to the real analysis of the industrial building project realization.
39 citations
TL;DR: This paper automatically generates new high-performing algorithms for the PFSP with the objectives makespan, total completion time and total tardiness, which outperform the best algorithms obtained by a manual algorithm engineering process.
37 citations
Cites methods from "Scheduling in flowshops to minimize..."
...We denote this variant by PFSPTT in what follows (Hasija and Rajendran, 2004; Li et al., 2015; Karabulut, 2016)....
[...]
...Several algorithms have been proposed for the PFSPTT, ranging from simulated annealing (Hasija and Rajendran, 2004) to genetic algorithms (Vallada and Ruiz, 2010)....
[...]
TL;DR: For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves.
35 citations
TL;DR: This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness and proposes a genetic algorithm procedure that was consistently effective in generating good solutions.
Abstract: This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.
32 citations
Cites methods from "Scheduling in flowshops to minimize..."
...(1995) and Parthasarathy and Rajendran (1997), a neighbourhood search based on the neighbourhood searches of Kim et al. (1996), Framinan and Leisten (2008)’s variable greedy algorithm and the fast ant colony algorithm developed by Holthaus and Rajendran (2005)....
[...]
TL;DR: Experimental results show that for the two considered problems, AHA1 outperforms the other algorithms on small setup- time instances and AHA3 is the most effective algorithm among the compared ones on big setup-time instances, while the computation time of AHA 1 is moderate among the LS1 integrated algorithms, so is AHA 3.
Abstract: In this paper, adaptive hybrid genetic algorithms (AHA0 ~ AHA3) are proposed for the sequence-dependent setup times permutation flow shop scheduling problem with the objectives to minimize makespan and total weighted tardiness, both of which will be considered separately. Each job is assigned an introduced inheriting factor, which indicates the probability that the job is copied to the same position of the offspring individual during crossover and is dynamically updated. Good genes and bad genes can be mined by inheriting factors. Probability-based Multi-Point Crossover (PMPC) is constructed to inherit good genes with high probabilities to the offspring and destroy bad genes with high probabilities. Inheriting factors determine such probabilities and the genetic algorithm evolves adaptively and is denoted as AHA0. Three local search methods (LS1, LS2, and LS3) are separately integrated with AHA0 and three hybrid algorithms AHA1 ~ AHA3 are developed. Compared with GA_RMA and CPSO (effective algorithms without integrating any local search), AHA0 is the most effective. Another six hybrid algorithms are extended from IG_RS (the current best algorithm for the two considered problems) and CPSO by integrating with the three local search methods and they are compared with AHA1 ~ AHA3 comprehensively. Experimental results show that for the two considered problems, AHA1 outperforms the other algorithms on small setup-time instances and AHA3 is the most effective algorithm among the compared ones on big setup-time instances, while the computation time of AHA1 is moderate among the LS1 integrated algorithms, so is AHA3. The effects of the key factors or parameters on algorithms are analyzed as well.
32 citations
Cites methods from "Scheduling in flowshops to minimize..."
...are generated from a uniform distribution [1], [10], and the due dates are yielded by a similar method given in [39]....
[...]
References
More filters
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Abstract: Each of a collection of items are to be produced on two machines (or stages). Each machine can handle only one item at a time and each item must be processed through machine one and then through machine two. The setup time plus work time for each item for each machine is known. A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum. A three-machine problem is also discussed and solved for a restricted case.
3,082 citations
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Abstract: In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2,255 citations
Additional excerpts
...Some of the noteworthy heuristics for minimizing makespan have been developed by Campbell et al. (1970), Dannenbring (1977), Nawaz et al. (1983), Widmer and Hertz (1989), Leisten (1990), Ogbu and Smith (1990), Ishibuchi et al. (1995), Rajendran (1995), Nowicki and Smutnicki (1996), Rajendran and…...
[...]
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
2,173 citations
"Scheduling in flowshops to minimize..." refers methods in this paper
...The test problems chosen for evaluating the heuristics under study are the benchmark problems proposed by Taillard (1993)....
[...]
...T 0i ¼ Xm j¼1 tij : ð11Þ Step 2: The due date of job i is given by Di ¼ T 0i ½1þ u 3 , ð12Þ where u is a uniform random number, generated using the routine given by Taillard (1993), in the range [0, 1]....
[...]
...The best-performing existing heuristics by Parthasarathy and Rajendran (1998) and Armentano and Ronconi (1999), and the proposed heuristic, are compared by using the benchmark problems of Taillard (1993)....
[...]
TL;DR: A simple algorithm for the solution of very large sequence problems without the use of a computer that produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time.
Abstract: This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time. Up to m-1 sequences may be found.
921 citations
Additional excerpts
...Some of the noteworthy heuristics for minimizing makespan have been developed by Campbell et al. (1970), Dannenbring (1977), Nawaz et al. (1983), Widmer and Hertz (1989), Leisten (1990), Ogbu and Smith (1990), Ishibuchi et al. (1995), Rajendran (1995), Nowicki and Smutnicki (1996), Rajendran and…...
[...]
TL;DR: In this paper, the branch-and-bound technique was applied to two flow-shop scheduling problems, i.e., 2-machine and 3-machine, with the objective of minimizing the makespan.
Abstract: The branch-and-bound technique of Little, et al. and Land and Doig is presented and then applied to two flow-shop scheduling problems. Computational results for up to 9 jobs are given for the 2-machine problem when the objective is minimizing the mean completion time. This problem was previously untreated. Results for up to 10 jobs, including comparisons with other techniques, are given for the 3-machine problem when the objective is minimizing the makespan.
575 citations