Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm

Computers and Operations Research

Volumn 40, Issue 6, 2013, Pages 1625-1647

  Lin, Shih Wei ^a   Ying, Kuo Ching ^b  

^a CHANG GUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Bi objective; Flowshop scheduling; Makespan; Total flowtime

Indexed keywords

BI OBJECTIVES; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; FLOW-SHOP SCHEDULING; MAKESPAN; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PERMUTATION FLOWSHOPS; TOTAL FLOWTIME;

BENCHMARKING; SCHEDULING; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 84875694772     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.08.009     Document Type: Article

References (22)

1. K.C. Ying Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic International Journal of Advanced Manufacturing Technology 38 2008 348 354
2. A. Reisman, A. Kumar, and J. Motwani Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 IEEE Transactions on Engineering Management 44 1997 316 329
3. K.C. Ying, and C.J. Liao An ant colony system for permutation flow-shop sequencing Computers and Operations Research 31 2004 791 801
4. 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 47 2009 1411 1424
5. J.M. Framinan, and R. Leisten A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria OR Spectrum 30 2008 787 804
6. H. Hoogeveen Multicriteria scheduling European Journal of Operational Research 167 2005 592 623
7. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multi-objective algorithms for the flowshop scheduling problem INFORMS Journal on Computing 20 2008 451 471
8. R.L. Graham, E.L. Lawler, J.K. Lenstra, and AHG Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
9. K.C. Ying, and S.W. Lin Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems International Journal of Advanced Manufacturing Technology 33 2007 793 802
10. J.M. Framinan, and R. Leisten An efficient constructive heuristic for flowtime minimisation in permutation flow shops OMEGA, International Journal of Management Science 31 2003 311 317
11. V. T'kindt, and J.C. Billaut Multicriteria scheduling: theory, models and algorithms 2002 Springer Heidelberg
12. J. Lemesre, C. Dhaenens, and E.G. Talbi An exact parallel method for a bi-objective permutation flowshop problem European Journal of Operational Research 177 2007 1641 1655
13. P.C. Chang, J.C. Hsieh, and S.G. Lin The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem International Journal of Production Economics 79 2002 171 183
14. T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm to minimize the makespan and total flowtime of jobs European Journal of Operational Research 167 2005 772 795
15. H. Ishibuchi, and T. Murata A multi-objective genetic local search algorithm and its application to flowshop scheduling IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 28 1998 392 403
16. T.P. Bagchi Multiobjective scheduling by genetic algorithms 1999 Kluwer Academic Publishers Boston
17. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation European Journal of Operational Research 141 2002 559 569
18. T. Pasupathy, C. Rajendran, and R.K. Suresh A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs International Journal of Advanced Manufacturing Technology 27 2006 804 815
19. C Rajendran, and H Ziegler A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs UK Chakraborty, Computational intelligence in flow shop and job shop scheduling - studies in computational intelligence vol. 230 2009 53 99
20. E. Taillard Benchmarks for basic scheduling-problems European Journal of Operational Research 64 1993 278 285
21. Martí R. Multi-start methods, in: Glover Fred, Kochenberger Gary A., editors. Handbook of metaheuristics. International Series in Operations Research & Management Sciences. The Netherlands, Dordrecht: Kluwer Academic Publishers; 2003. p. 355-68 [Chapter 12].
22. E. Zitzler, and L. Thiele Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach IEEE Transactions on Evolutionary Computation 3 1999 257 271