Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

Applied Mathematics and Computation

Volumn 217, Issue 2, 2010, Pages 557-567

  Liao, Li Man ^a   Huang, Ching Jen ^a  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

MILP model; Non permutation flowshop; Scheduling; Tabu search; Tardiness

Indexed keywords

COMPUTATIONAL EXPERIMENT; DUE DATES; FLOW SHOP PROBLEMS; JOB SEQUENCES; MILP MODEL; MIXED-INTEGER LINEAR PROGRAMMING; NEIGHBORHOOD STRUCTURE; NON-PERMUTATION FLOWSHOP; OBJECTIVE FUNCTIONS; ON-MACHINES; PERMUTATION FLOW SHOPS; PERMUTATION SCHEDULES; SEARCH-BASED ALGORITHMS; SEARCHING METHODS; TARDINESS; TOTAL TARDINESS;

ALGORITHMS; INTEGER PROGRAMMING; MACHINE SHOPS;

TABU SEARCH;

EID: 77955664188     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2010.05.089     Document Type: Article

References (26)

1. Y.D. Kim Minimizing total tardiness in permutation flowshops European Journal of Operational Research 85 1995 541 555
2. R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2005 479 494
3. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
4. M. Pinedo Scheduling: Theory, Algorithms and Systems second ed. 2002 Prentice-Hall Englewood Cliffs, NJ
5. V.A. Armentano, and D.P. Ronconi Tabu search for total tardiness minimization in flowshop scheduling problems Computers and Operations Research 26 1999 219 235
6. A.I. Sonmez, and A. Baykasoglu A new dynamic programming formulation of (n × m) flowshop sequencing problems with due dates International Journal of Production Research 36 1998 2269 2283
7. C.S. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems European Journal of Operational Research 174 2006 1 10
8. J.C.H. Pan, J.S. Chen, and C.M. Chao Minimizing tardiness in a two-machine flowshop Computers and Operations Research 29 2002 869 885
9. Y.D. Kim Heuristics for flowshop scheduling problems minimizing mean tardiness Journal of Operational Research Society 44 1993 19 28
10. S. Parthasarathy, and C. Rajendran Simulated annealing approach to scheduling in a flowshop with multiple processors Computers and Industrial Engineering 34 1998 531 546
11. S. Hasija, and C. Rajendran Scheduling in flowshops to minimize total tardiness of jobs International Journal of Production Research 42 2004 2289 2301
12. M. Tandon, P.T. Cummings, and M.D. LeVan Flowshop sequencing with non-permutation schedules Computers and Chemical Engineering 15 1991 601 607
13. C. Koulamas A new constructive heuristic for the flowshop scheduling problem European Journal of Operational Research 105 1998 66 71
14. S. Pugazhendhi, S. Thiagarajan, C. Rajendran, and N. Anantharaman Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems Computers and Industrial Engineering 44 2003 133 157
15. S.W. Lin, and K.C. Ying Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems International Journal of Production Research 46 2008 1 14
16. R. Swaminathan, M.E. Pfund, J.W. Fowler, S.J. Mason, and A.R. Keha Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times Computers and Operations Research 34 2007 3055 3068
17. C.J. Liao, L.M. Liao, and C.T. Tseng A performance evaluation of permutation vs. non-permutation schedules in a flowshop International Journal of Production Research 44 2006 4297 4309
18. E.F. Stafford Jr., and F.T. Tseng On 'Redundant' constraints in Stafford's MILP model for the flowshop problem Journal of the Operational Research Society 54 2003 1102 1105
19. F.T. Tseng, E.F. Stafford Jr., and J.N.D. Gupta An empirical analysis of integer programming formulations for the permutation flowshop Omega 32 2004 285 293
20. E.F. Stafford Jr., F.T. Tseng, and J.N. D Gupta Comparative evaluation of MILP flowshop models Journal of the Operational Research Society 56 2005 88 101
21. H.M. Wagner An integer linear-programming model for machine scheduling Naval Research Logistics Quarterly 6 1959 131 140
22. J.M. Wilson Alternative formulations of a flowshop scheduling problem Journal of the Operational Research Society 40 1989 395 399
23. A.S. Manne On the job-shop scheduling problem Operations Research 8 1960 219 223
24. C.J. Liao, and C.T. You An improved formulation for the job shop scheduling problem Journal of the Operational Research Society 43 1992 1047 1054
25. W.B. Carlton, and J.W. Barnes A note on hashing functions and tabu search algorithms European Journal of Operational Research 95 1996 237 239
26. F. Glover, E. Taillard, and D. deWerra A user's guide to tabu search Annals of Operations Research 41 1993 3 28