scispace - formally typeset

Journal ArticleDOI

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.
Topics: Adaptive simulated annealing (57%), Tardiness (57%), Simulated annealing (53%), Heuristic (computer science) (53%)
Citations
More filters

Journal ArticleDOI
Rubén Ruiz1, Thomas Stützle2Institutions (2)
TL;DR: Two new IG algorithms are proposed for a complex flowshop problem that results from the consideration of sequence dependent setup times on machines, a characteristic that is often found in industrial settings.
Abstract: Iterated Greedy (IG) algorithms are based on a very simple principle, are easy to implement and can show excellent performance. In this paper, we propose two new IG algorithms for a complex flowshop problem that results from the consideration of sequence dependent setup times on machines, a characteristic that is often found in industrial settings. The first IG algorithm is a straightforward adaption of the IG principle, while the second incorporates a simple descent local search. Furthermore, we consider two different optimization objectives, the minimization of the maximum completion time or makespan and the minimization of the total weighted tardiness. Extensive experiments and statistical analyses demonstrate that, despite their simplicity, the IG algorithms are new state-of-the-art methods for both objectives.

328 citations


Journal ArticleDOI
TL;DR: This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area, and identifies the best-performing methods from the literature.
Abstract: This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting, and Pareto approaches have been reviewed. Exact, heuristic, and metaheuristic methods have been surveyed. Furthermore, a complete computational evaluation is also carried out. A total of 23 different algorithms including both flowshop-specific methods as well as general multiobjective optimization approaches have been tested under three different two-criteria combinations with a comprehensive benchmark. All methods have been studied under recent state-of-the-art quality measures. Parametric and nonparametric statistical testing is profusely employed to support the observed performance of the compared methods. As a result, we have identified the best-performing methods from the literature, which along with the review, constitutes a reference work for further research.

160 citations


Cites background or methods from "Scheduling in flowshops to minimize..."

  • ...As regards the due dates for the tardiness criterion we use the same approach of Hasija and Rajendran (2004)....

    [...]

  • ...For example, Ho and Chang (1991) propose a heuristic that is specifically devised for minimizing machine idle time in an m machine flowshop....

    [...]


Journal ArticleDOI
Eva Vallada1, Rubén Ruiz1Institutions (1)
Abstract: In this work three genetic algorithms are presented for the permutation flowshop scheduling problem with total tardiness minimisation criterion. The algorithms include advanced techniques like path relinking, local search and a procedure to control the diversity of the population. We also include a speed up procedure in order to reduce the computational effort needed for the local search technique, which results in large CPU time savings. A complete calibration of the different parameters and operators of the proposed algorithms by means of a design of experiments approach is also given. We carry out a comparative evaluation with the best methods that can be found in the literature for the total tardiness objective, and with adaptations of other state-of-the-art methods originally proposed for other objectives, mainly makespan. All the methods have been implemented with and without the speed up procedure in order to test its effect. The results show that the proposed algorithms are very effective, outperforming the remaining methods of the comparison by a considerable margin.

147 citations


Cites methods or result from "Scheduling in flowshops to minimize..."

  • ...A simulated annealing method can be found in Hasija and Rajendran (2004) which starts from the solution provided by Parthasarathy and Rajendran (1998) and then applies a local search procedure to improve it....

    [...]

  • ...Finally, if we compare the results of the existing methods from the total tardiness literature: the SAH by Parthasarathy and Rajendran (1997b) and the SRH by Hasija and Rajendran (2004), we can see that these algorithms show a poor performance and are outperformed by almost all other algorithms....

    [...]

  • ...…for the total tardiness objective, from the comparative evaluation by Vallada et al. (2008) we have chosen the best two performing methods: the simulated annealing algorithms by Parthasarathy and Rajendran (1997b) and Hasija and Rajendran (2004), which are referred to as SAH and SRH, respectively....

    [...]

  • ...(2008) we have chosen the best two performing methods: the simulated annealing algorithms by Parthasarathy and Rajendran (1997b) and Hasija and Rajendran (2004), which are referred to as SAH and SRH, respectively. We want to remark that all methods have been implemented with and without the speed up procedure explained in subsection 3.3. The only exception is the SAH algorithm since in this method the local search is applied in a di erent and unordered way and therefore the speed up is not possible unless the local search step for this algorithm is completely changed. We di erentiate the methods tested with and without the speed up by adding su (speed up) to the end of the method's names. For example, HGAsu and HGA refer to the HGA method with and without speed up, respectively. To test all the methods and variations (15 in total), we use the benchmark of instances available from http://soa.iti.es, which are the same 540 problems that Vallada et al. (2008) proposed, ranging from 50 to 350 jobs and from 10 to 30 machines....

    [...]

  • ...We can also observe the e ect of the speed up procedure: all the methods show substantially better results except for the SRH algorithm by Hasija and Rajendran (2004), which seems to be stalled as the speed up provides no advantage....

    [...]


Journal ArticleDOI
Eva Vallada1, Rubén Ruiz1, Gerardo Minella1Institutions (1)
TL;DR: A review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented and the results allow us to clearly identify the state-of-the-art methods.
Abstract: In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented. Published reviews about this objective usually deal with a single machine or parallel machines and no recent methods are compared. Moreover, the existing reviews do not use the same benchmark of instances and the results are difficult to reproduce and generalise. We have implemented a total of 40 different heuristics and metaheuristics and we have analysed their performance under the same benchmark of instances in order to make a global and fair comparison. In this comparison, we study from the classical priority rules to the most recent tabu search, simulated annealing and genetic algorithms. In the evaluations we use the experimental design approach and careful statistical analyses to validate the effectiveness of the different methods tested. The results allow us to clearly identify the state-of-the-art methods.

135 citations


Cites methods from "Scheduling in flowshops to minimize..."

  • ...Basic tabu search Diversification, intensification and restricted neighbourhood 2003 Rajendran and Ziegler Weighted flowtime and LS Improvement of a heuristic method weighted tardiness 2004 Hasija and Rajendran Total tardiness SA Initial solution given by a despatching rule Local search procedures 2006 Onwubolu and Davendra Total tardiness DE Initial population is generated randomly Conversion from discrete to real values and vice-versa TS = tabu search, SA = simulated annealing, GA = genetic algorithm, DE = differential evolution, LS = local search....

    [...]

  • ...From the metaheuristics tested, the two simulated annealing algorithms proposed by [30,37] outperform all the other methods evaluated....

    [...]

  • ...The best performing methods are the simulated annealing algorithms SAH and SRH proposed in [30,37], respectively....

    [...]

  • ...[21] TS1 TS 40 × 16 G TS2 TS 40 × 16 G TS3 TS 40 × 16 G SA1 SA 40 × 16 G SA3 SA 40 × 16 G 1997 Parthasarathy and Rajendran [30] SAH SA 95 × 9 S 1999 Onwubolu and Mutingi [33] GA GA 30 × 15 R 1999 Armentano and Ronconi [35] TSB TS 50 × 20 G TSD TS 50 × 20 G TSR TS 50 × 20 G 2003 Rajendran and Ziegler [36] HA+IS2 LS 30 × 20 S 2004 Hasija and Rajendran [37] SRH SA 100 × 20 S 2006 Onwubolu and Davendra [39] DE DE 100 × 30 ?/R...

    [...]

  • ...We did a very similar experiment with the SRH simulated annealing proposed in [37] which is one of the best performing algorithms as our results have shown....

    [...]


Journal ArticleDOI
Abstract: In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant of the well-known permutation flowshop scheduling problem where idle time is not allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions: First of all, a discrete artificial bee colony algorithm is presented to solve the problem on hand first time in the literature. Secondly, some novel methods of calculating the total tardiness from makespan are introduced for the no-idle permutation flowshop scheduling problem. Finally, the main contribution of the paper is due to the fact that a novel speed-up method for the insertion neighborhood is developed for the total tardiness criterion. The performance of the discrete artificial bee colony algorithm is evaluated against a traditional genetic algorithm. The computational results show its highly competitive performance when compared to the genetic algorithm. Ultimately, we provide the best known solutions for the total tardiness criterion with different due date tightness levels for the first time in the literature for the Taillard’s benchmark suit.

75 citations


References
More filters

Journal ArticleDOI
Selmer Martin Johnson1Institutions (1)
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.

2,932 citations


Journal ArticleDOI
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,068 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…...

    [...]


Journal ArticleDOI
Éric D. Taillard1Institutions (1)
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.
Abstract: In this paper, we propose 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are: the permutation flow shop, the job shop and the open shop scheduling problems. We restrict ourselves to basic problems: the processing times are fixed, there are neither set-up times nor due dates nor release dates, etc. Then, the objective is the minimization of the makespan.

1,945 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)....

    [...]


Journal ArticleDOI
01 Jun 1970-Management Science
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.

896 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…...

    [...]


Journal ArticleDOI
Edward Ignall1, Linus Schrage1Institutions (1)
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.

554 citations


Performance
Metrics
No. of citations received by the Paper in previous years
YearCitations
20221
20215
20206
20194
20182
20172