Abstract
Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. The trade-offs involved in considering several different criteria provide useful insights for the decision maker. Surprisingly, research in the field of multi-objective scheduling has been quite limited when compared to research in single criterion scheduling. The subject of this paper is the bicriteria scheduling problem in a two-machine flowshop. The objective is to find a job sequence that minimizes sum of weighted total flowtime and total tardiness. Based on the problem characteristics, a Simulated Annealing algorithm is developed. The proposed metaheuristic is compared with the branch and bound enumeration algorithm of the integer programming model as well as a modified version of the well-known NEH algorithm. During these evaluations, the experimental design approach and careful statistical analysis have been used to validate the effectiveness of the simulated annealing approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, K.R., Trietsch, D.: Principles of Sequencing and Scheduling. John Wiley and Sons, New York (2009)
Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2007)
Chen, C.L., Bulfin, R.L.: Complexity of a Single Machine Multi-criteria Scheduling Problems. Eur. J. Oper. Res. 70, 115–125 (1993)
Chou, F.D., Lee, C.E.: Two-Machine Flowshop Scheduling with Bicriteria Problem. Comput. Ind. Eng. 36, 549–564 (1999)
Daniels, R.L., Chambers, R.J.: Multiobjective Flowshop Scheduling. Nav. Res. Log. 37, 981–995 (1990)
Eren, T., Guner, E.: A Bicriteria Flowshop Scheduling with a Learning Effect. Appl. Math. Model. 32, 1719–1733 (2007)
Fisher, M.L.: A Dual Algorithm for the One-Machine Scheduling Problem. Math. Program. 11, 229–251 (1976)
French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Jobshop. Ellis Horwood, Chichester (1982)
Gonzales, T., Sahni, S.: Flowshop and Jobshop Schedules. Oper. Res. 26, 36–52 (1978)
Gupta, J.N.D., Stafford Jr., E.F.: Flowshop Scheduling Research after Five Decades. Eur. J. Oper. Res. 169, 699–711 (2006)
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)
Hoogeveen, H.: Multicriteria scheduling. Eur. J. Oper. Res. 167, 592–623 (2005)
Jackson, J.R.: Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Research Project, UCLA (1955)
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)
Johnson, S.M.: Optimal Two- and Three- Stage Production Schedules with Set-up Times Included. Nav. Res. Log. Quart. 1, 61–68 (1954)
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)
Lei, D.: Multi-objective Production Scheduling: a Survey. Int. J. Adv. Manuf. Tech. 43, 926–938 (2009)
Lenstra, J.K., Rinnooy kan, A.H.G., Brucker, P.: Complexity of Machine Scheduling Problems. Ann. Discrete Math. 4, 281–300 (1977)
Lewis, T.G., El-Rewini, H.: Introduction to Parallel Computing: Chapter Scheduling Parallel Programs. Prentice-Hall Inc., Englewood Cliffs (1992)
LINDO Systems Inc. Extended LINGO Release 9.0. Chicago, IL (2005)
Loukil, T., Teghem, J., Tuyttens, D.: Solving Multi-Objective Production Scheduling Problems Using Metaheuristics. Eur. J. Oper. Res. 161, 42–61 (2005)
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)
Nagar, A., Haddock, J., Heragu, S.: Multiple and Bicriteria Scheduling: A Literature Survey. Eur. J. Oper. Res. 81, 88–104 (1995)
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)
Nearchou, A.C.: A Novel Metaheuristic Approach for the Flowshop Scheduling Problem. Eng. Appl. Artif. Intel. 17, 289–300 (2004)
Panwalker, S.S., Iskander, W.: A Survey of Scheduling Rule. Oper. Res. 25, 45–61 (1977)
Pham, D.T., Karaboga, D.: Intelligent Optimization Techniques: Genetic Algorithms. In: Tabu Search, Simulated Annealing and Neural Networks. Springer, London (2000)
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)
Smith, W.E.: Various Optimizers for Single Stage production. Nav. Res. Log. Quart. 3, 59–66 (1956)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mesgarpour, M., Kirkavak, N., Ozaktas, H. (2010). Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing. In: Cowling, P., Merz, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2010. Lecture Notes in Computer Science, vol 6022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12139-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-12139-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12138-8
Online ISBN: 978-3-642-12139-5
eBook Packages: Computer ScienceComputer Science (R0)