scispace - formally typeset
Search or ask a question
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.
Citations
More filters
Journal ArticleDOI
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.

367 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.

172 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
TL;DR: In this article, three genetic algorithms are presented for the permutation flow shop scheduling problem with total tardiness minimisation criterion, which includes advanced techniques like path relinking, local search and a procedure to control the diversity of the population.
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.

160 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
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.

154 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
TL;DR: The proposed multi-objective Iterated Greedy method is shown to outperform other recent approaches in comprehensive computational and statistical tests that comprise a large number of instances with objectives involving makespan, tardiness and flowtime.

88 citations


Cites 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)....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: This work addresses the permutation flowshop scheduling problem with the objective of minimizing total tardiness and investigates the application of tabu search to this problem in order to obtain better solutions in a reasonable time.

116 citations


"Scheduling in flowshops to minimize..." refers background or methods in this paper

  • ...A comparison of the proposed heuristic (denoted by SRH) is made with the bestexisting heuristics, namely, the tabu search heuristic by Armentano and Ronconi (1999) (denoted by ARH in the present study) and the simulated annealing heuristic by Parthasarthy and Rajendran (1998) (denoted by PRH in the…...

    [...]

  • ...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)....

    [...]

  • ...The heuristic proposed by Armentano and Ronconi (1999) is based on tabu search with the objective of minimizing total tardiness of jobs in flowshop scheduling problems....

    [...]

  • ...In a parallel and independent work, Armentano and Ronconi (1999) proposed a heuristic, based on the tabu search procedure....

    [...]

  • ...…1366–588X online # 2004 Taylor & Francis Ltd http://www.tandf.co.uk/journals DOI: 10.1080/00207540310001657595 literature review that the heuristics by Parthasarathy and Rajendran (1998), and Armentano and Ronconi (1999) are the best-performing heuristics to minimize the total tardiness of jobs....

    [...]

Journal ArticleDOI
TL;DR: In this paper, four heuristic methods for obtaining a good solution to the sum of weighted tardiness and weighted flow-time problem are proposed, and a, recommendation is made with respect to other objective functions.
Abstract: This paper concerns the minimization of a complex cost function in a flow-shop. Four heuristic methods for obtaining a good solution to the sum of weighted tardiness and weighted flow-time problem are proposed. Computational results are provided and a, recommendation is made with respect to other objective functions.

103 citations


"Scheduling in flowshops to minimize..." refers background in this paper

  • ...The first attempt was by Gelders and Sambandam (1978)....

    [...]

Journal ArticleDOI
TL;DR: In this article, the authors address the backlog sequencing problem in a flow shop controlled by a CONWIP production control system, with the objective to minimize the makespan, and analyze its similarities and differences with the unconstrained permutation flow-shop problem.
Abstract: In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CONWIP production control system, with the objective to minimize the makespan. We characterize the problem and analyse its similarities and differences with the unconstrained permutation flow-shop problem. A comparison of some well-known flow-shop heuristics is carried out, and a simple and fast dispatching rule is proposed. Regarding the more simple and faster heuristics, the proposed dispatching rule outperforms those commonly used for the unconstrained permutation flow-shop problem.

48 citations

Journal ArticleDOI
TL;DR: In this article, a heuristic algorithm based on the simulated annealing (SA) technique is developed for scheduling in flow shop and flowline-based manufacturing cell with the objective of minimizing mean tardiness of jobs.

43 citations


"Scheduling in flowshops to minimize..." refers methods in this paper

  • ...…the proposed heuristic (denoted by SRH) is made with the bestexisting heuristics, namely, the tabu search heuristic by Armentano and Ronconi (1999) (denoted by ARH in the present study) and the simulated annealing heuristic by Parthasarthy and Rajendran (1998) (denoted by PRH in the current study)....

    [...]

  • ...The heuristic by Parthasarthy and Rajendran (1998) is based on the SA technique....

    [...]

  • ...For the purpose of relative evaluation of the proposed SA algorithm, the SA heuristic by Parthasarthy and Rajendran (1998) that makes use of RIPS is considered in this study....

    [...]

Journal ArticleDOI
TL;DR: The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan and heuristic algorithms are developed by the introduction of simplifying assumptions.
Abstract: The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan. Heuristic algorithms are developed by the introduction of simplifying assumptions into the scheduling problem under study. An improvement method is incorporated in the heuristics to enhance the quality of their solutions. The proposed heuristics and an existing heuristic are evaluated by a large number of randomly generated problems. The results of an extensive computational investigation for various values of parameters are presented.

36 citations


"Scheduling in flowshops to minimize..." refers background in this paper

  • ...…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 Ziegler (1997), Ben-Daya and AlFawzan (1998), and Framinan et al. (2001)....

    [...]