A performance evaluation of permutation vs. non-permutation schedules in a flowshop

International Journal of Production Research

Volumn 44, Issue 20, 2006, Pages 4297-4309

  Liao, C J ^a   Liao, L M ^b   Tseng, C T ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Flowshop; Non permutation schedules; Scheduling

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

FLOWSHOPS; NON-PERMUTATION SCHEDULES;

COMPUTATIONAL METHODS;

EID: 33748522007     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600595892     Document Type: Article

References (27)

1. Armentano, V.A. and Ronconi, D.P., Tabu search for total tardiness minimization in flowshop scheduling problems. Comput. Oper. Res., 1999, 26, 219-235.
2. Ben-Daya, M. and Al-Fawzan, M., A tabu search approach for the flow shop scheduling problem. Eur. J. Oper. Res., 1998, 109, 88-95.
3. Crainic, T.G., Gendreau, M. and Farvolden, J.M., Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem. INFORMS J. Comput., 2000, 12, 223-236.
4. Framinan, J.M. and Leisten, R., An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 2003, 31, 311-317.
5. Gendreau, M., Guertin, F., Potvin, J.-Y. and Taillard, É.D., Parallel tabu search for real-time vehicle routing and dispatching. Transport. Sci., 1999, 33, 381-390.
6. Glover, F., Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res., 1986, 13, 533-549.
7. Glover, F., A user's guide tabu search. Ann. Oper. Res., 1993, 41, 3-28.
8. Grabowski, J. and Wodecki, M., A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res., 2004, 10, 281-284.
9. Hao, Q., Yang, Z., Wang, D. and Li, Z., Common due-date determination and sequencing using tabu search. Comput. Oper. Res., 1996, 23, 409-417.
10. Koulamas, C., A new constructive heuristic for the flowshop scheduling problem. Eur. J. Oper. Res., 1998, 105, 66-71.
11. Nawaz, M., Encore, E.E. and Ham, I., A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 1983, 11, 91-95.
12. Pinedo, M., Scheduling: Theory, Algorithms and Systems, 2nd ed., 2002 (NJ: Prentice-Hall: Englewood Cliffs, NJ).
13. Potts, C.N., Shmoys, D.B. and Williamson, D.P., Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett., 1991, 10, 281-284.
14. Potts, C.N. and Van Wassenhove, L.N., A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett., 1982, 1, 177-181.
15. Pugazhendhi, S., Thiagarajan, S., Rajendran, C. and Anantharaman, N., Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems. Comput. Ind. Eng., 2002, 44, 133-157.
16. Pugazhendhi, S., Thiagarajan, S., Rajendran, C. and Anantharaman, N., Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective. Int. J. Adv. Manuf. Technol., 2004a, 23, 820-830.
17. Pugazhendhi, S., Thiagarajan, S., Rajendran, C. and Anantharaman, N., Generating non-permutation schedules in flowline-based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. Int. J. Adv. Manuf. Technol., 2004b, 23, 64-78.
18. Rajendran, C. and Ziegler, H., A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs. Eur. J. Oper. Res., 2001, 131, 622-634.
19. Rebaine, D., Flow shop vs. permutation shop with time delays. Comput. Intl. Eng., 2005, 48, 357-362.
20. Reeves, C.R., A genetic algorithm for flowshop sequencing. Comput. Oper. Res., 1995, 22, 5-13.
21. Ruiz, R. and Maroto, C., A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res., 2005, 165, 479-494.
22. Skorin-Kapov, J., Tabu search applied to the quadratic assignment problem. ORSA J. Comput., 1990, 2, 33-45.
23. Sridhar, J. and Rajendran, C., Scheduling in flowshop and cellular manufacturing systems with multiple objectives - a genetic algorithmic approach. Prod. Plan. Control, 1996, 7, 374-382.
24. Stützle, T., Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TH Darmstadt, Germany, 1998.
25. Taillard, E., Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res., 1990, 47, 65-74.
26. Taillard, E., Benchmarks for basic scheduling problems. Eur. J. Oper. Res., 1993, 64, 278-285.
27. Tandon, M., Cummings, P.T. and LeVan, M.D., Flowshop sequencing with non-permutation schedules. Comput. Chem. Eng., 1991, 15, 601-607.