Bicriteria scheduling problem on the two-machine flowshop using simulated annealing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6022 LNCS, Issue , 2010, Pages 166-177

  Mesgarpour, Mohammad ^a   Kirkavak, Nureddin ^b   Ozaktas, Hakan ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

^c ATILIM UNIVERSITY   (Turkey)

Author keywords

Bicriteria Scheduling; Flowshop Scheduling; Simulated Annealing

Indexed keywords

COMBINATORIAL OPTIMIZATION; DECISION MAKING; ECONOMIC AND SOCIAL EFFECTS; EVOLUTIONARY ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING;

BICRITERIA SCHEDULING; BICRITERIA SCHEDULING PROBLEM; ENUMERATION ALGORITHMS; EXPERIMENTAL DESIGN APPROACHES; FLOW-SHOP SCHEDULING; INTEGER PROGRAMMING MODELS; MULTI-OBJECTIVE SCHEDULING; SIMULATED ANNEALING ALGORITHMS;

SIMULATED ANNEALING;

EID: 77952299339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12139-5_15     Document Type: Conference Paper

References (30)

1. Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. John Wiley and Sons, New York (2009)
2. Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2007)
3. Chen, C.L., Bulfin, R.L.: Complexity of a Single Machine Multi-criteria Scheduling Problems. Eur. J. Oper. Res. 70, 115-125 (1993)
4. Chou, F.D., Lee, C.E.: Two-Machine Flowshop Scheduling with Bicriteria Problem. Comput. Ind. Eng. 36, 549-564 (1999)
5. Daniels, R.L., Chambers, R.J.: Multiobjective Flowshop Scheduling. Nav. Res. Log. 37, 981-995 (1990)
6. Eren, T., Guner, E.: A Bicriteria Flowshop Scheduling with a Learning Effect. Appl. Math. Model. 32, 1719-1733 (2007)
7. Fisher, M.L.: A Dual Algorithm for the One-Machine Scheduling Problem. Math. Program. 11, 229-251 (1976)
8. French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Jobshop. Ellis Horwood, Chichester (1982)
9. Gonzales, T., Sahni, S.: Flowshop and Jobshop Schedules. Oper. Res. 26, 36-52 (1978)
10. Gupta, J.N.D., Stafford Jr., E.F.: Flowshop Scheduling Research after Five Decades. Eur. J. Oper. Res. 169, 699-711 (2006)
11. Henderson, D., Jacobson, S.H., Johnson, A.W.: The Theory and Practice of Simulated Annealing. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. Kluwer Academic publisher, Dordrecht (2003)
12. Hoogeveen, H.: Multicriteria scheduling. Eur. J. Oper. Res. 167, 592-623 (2005)
13. Jackson, J.R.: Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Research Project, UCLA (1955)
14. Johnson, D.S., Aragon, C.R., McGooch, L., Schevon, C.: Optimization by Simulated Annealing: Experimental Evaluation Part 1. Graph partitioning. Oper. Res. 37, 865-891 (1989)
15. Johnson, S.M.: Optimal Two- and Three- Stage Production Schedules with Set-up Times Included. Nav. Res. Log. Quart. 1, 61-68 (1954)
16. Kalczynski, P.J., Kamburowski., J.: On the NEH Heuristics for Minimizing the Makespan in Permutation Flowshops. Omega-Int. J. Manage. S. 35, 53-60 (2007)
17. Lei, D.: Multi-objective Production Scheduling: a Survey. Int. J. Adv. Manuf. Tech. 43, 926-938 (2009)
18. Lenstra, J.K., Rinnooy kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Ann. Discrete Math. 4, 281-300 (1977)
19. Lewis, T.G., El-Rewini, H.: Introduction to Parallel Computing: Chapter Scheduling Parallel Programs. Prentice-Hall Inc., Englewood Cliffs (1992)
20. LINDO Systems Inc. Extended LINGO Release 9.0. Chicago, IL (2005)
21. Loukil, T., Teghem, J., Tuyttens, D.: Solving Multi-Objective Production Scheduling Problems Using Metaheuristics. Eur. J. Oper. Res. 161, 42-61 (2005)
22. Metropolis, N., Rosenbluth, A.W., Teller, A.H., Teller, E.: Equation of State Calculation by Fast Computing Machines. J. Chem. Phys. 21, 1087-1091 (1953)
23. Nagar, A., Haddock, J., Heragu, S.: Multiple and Bicriteria Scheduling: A Literature Survey. Eur. J. Oper. Res. 81, 88-104 (1995)
24. Nawaz, M., Enscore Jr., E.E., Ham, I.: A Heuristic Algorithm for the m-Machine, n-Job Flowshop Sequencing Problem. Omega-Int. J. Manage. S. 11, 91-95 (1983)
25. Nearchou, A.C.: A Novel Metaheuristic Approach for the Flowshop Scheduling Problem. Eng. Appl. Artif. Intel. 17, 289-300 (2004)
26. Panwalker, S.S., Iskander, W.: A Survey of Scheduling Rule. Oper. Res. 25, 45-61 (1977)
27. Pham, D.T., Karaboga, D.: Intelligent Optimization Techniques: Genetic Algorithms. In: Tabu Search, Simulated Annealing and Neural Networks. Springer, London (2000)
28. Rajendran, C., Ziegler, H.: Scheduling to Minimize the Sum of Weighted Flowtime and Weighted Tardiness of Jobs in a Flowshop with Sequence-Dependent Setup Times. Eur. J. Oper. Res. 149, 513-522 (2003)
29. Smith, W.E.: Various Optimizers for Single Stage production. Nav. Res. Log. Quart. 3, 59-66 (1956)
30. Tian, P., Ma, J., Zhang, D.-M.: Application of the Simulated Annealing Algorithm to the Combinatorial Optimization Problem with Permutation Property: An Investigation of Generation Mechanism. Eur. J. Oper. Res. 118, 81-94 (1999)