Total tardiness minimization in permutation flow shops: A simple approach based on a variable greedy algorithm

International Journal of Production Research

Volumn 46, Issue 22, 2008, Pages 6479-6498

  Framinan, J M ^a   Leisten, R ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Due dates; Flow shop; Greedy algorithm; Scheduling

Indexed keywords

BOOLEAN FUNCTIONS;

DUE DATES; FLOW SHOP; GREEDY ALGORITHM; SCHEDULING;

MATHEMATICAL TRANSFORMATIONS;

EID: 53349141488     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701418960     Document Type: Article

References (21)

1. Armentano, V.A. and Ronconi, D., Tabu search for total tardiness minimization in flowshop scheduling problems. Comput. Oper. Res., 1999, 26, 219-235.
2. Chakravarthy, K. and Rajendran, C., A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod. Plan. Contr., 1999, 10, 707-714.
3. Demirkol, E., Mehta, S. and Uzsoy, R., Benchmarks for shop scheduling problems. Eur. J. Oper. Res., 1998, 109, 137-141.
4. Framinan, J.M. and Leisten, R., A heuristic for scheduling a permutation flow shop with makespan objective subject to maximum tardiness. Int. J. Prod. Econ., 2006, 99, 28-40.
5. Gagné, C., Gravel, M. and Price, W.L., A new hybrid Tabu-VNS metaheuristic for solving multiple objective scheduling problems, in Proceedings of the 5th Metaheuristics International Conference, Kyoto, Japan, 2003.
6. Gelders, L.F. and Sambandam, N., Four simple heuristics for scheduling a flowshop. Int. J. Prod. Res., 1978, 16, 221-231.
7. Hansen, P. and Mladenović, N., Variable neighbourhood search: principles and applications. Eur. J. Oper. Res., 2001, 130, 449-467.
8. Hasija, S. and Rajendran, C., Scheduling in flowshops to minimize total tardiness of jobs. Int. J. Prod. Res., 2004, 42, 2289-2301.
9. Kim, Y.D., Heuristics for flow shop scheduling problems minimizing mean tardiness. J. Oper. Res. Soc., 1993, 44, 19-28.
10. Lourenço, H.R., Martin, O. and Stützle, T., Iterated local search. In Handbook of Metaheuristics, edited by F. Glover and G. Kochenberger, pp. 321-353, 2002 (Kluwer: Dordrech).
11. Marchiori, E. and Steenbeek, A., An evolutionary algorithm for large set covering problems with applications to airline crew scheduling. In Real Applications of Evolutionary Computing, EvoWorkshops 2000. Lecture Notes in Computer Science No. 1803, edited by S. Cagnoni, pp. 367-381, 2000 (Springer: Berlin).
12. Mladenović, N. and Hansen, P., Variable neighborhood search. Comput. Oper. Res., 1997, 24, 1097-1100.
13. Nawaz, M., Enscore, E.E. and Ham, I., A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, 1983, 11, 91-95.
14. Parthasarthy, S. and Rajendran, C., Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell. Comput. Ind. Eng., 1998, 34, 531-546.
15. Reza Hejazi, S. and Saghafian, S., Flowshop-scheduling problems with makespan criterion: a review. Int. J. Prod. Res., 2005, 43, 2895-2929.
16. Ruiz, R. and Maroto, C., A comprehensive review and evaluation of flowshop heuristics. Eur. J. Oper. Res., 2005, 165, 479-494.
17. Ruiz, R. and Stützte, T., A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res., 2007, 177, 2033-2049.
18. Schuster, C. and Framinan, J.M., Approximative procedures for no-wait job shop scheduling. Oper. Res. Lett., 2003, 31, 308-318.
19. Taillard, E., Benchmark for basic scheduling problems. Eur. J. Oper. Res., 1993, 64, 278-285.
20. Tasgetiren, M.F., Sevkli, M., Liang, Y.C. and Gencyilmaz, G., Particle swarm optimization algorithm for single machine total weighted tardiness problem, in Proceedings of the IEEE Congress on Evolutionary Computation, Portland, OR, USA, 2004, pp. 1412-1419.
21. Uzsoy, R., Benchmark Scheduling Problems. Available online at: http://palette.ecn.purdue.edu/~uzsoy2/benchmark/problems.html (accessed on 11 April 2006).