A greedy heuristic and simulated annealing approach for a bicriteria flowshop scheduling problem with precedence constraints—a practical manufacturing case
 Samer Hanoun,
 Saeid Nahavandi
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper considers a flowshop scheduling problem with two criteria, where the primary (dominant) criterion is the minimization of material waste and the secondary criterion is the minimization of the total tardiness time. The decision maker does not authorize tradeoffs between the criteria. In view of the nature of this problem, a hierarchical (lexicographical) optimization approach is followed. An effective greedy heuristic is proposed to minimize the material waste and a simulated annealing (SA) algorithm is developed to minimize the total tardiness time, subjective to the constraint computed for the primary criterion. The solution accuracy is compared with the optimal solution obtained by complete enumeration for randomly generated problem sets. From the results, it is observed that the greedy heuristic produces the optimal solution and the SA solution does not differ significantly from the optimal solution.
 Evans, GW (1984) An overview of techniques for solving multiobjective mathematical programs. Manage Sci 30: pp. 12681282 CrossRef
 Fry, TD, Armstrong, RD, Lewis, H (1999) A framework for single machine multiple objective sequencing research. Omega 17: pp. 595607 CrossRef
 Nagar, A, Heragu, SS, Haddock, J (1995) A branch and bound approach for a twomachine flowshop scheduling problem. J Oper Res Soc 46: pp. 721734
 Sridhar, J, Rajendran, C (1996) Scheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithmic approach. Prod Plan Control 7: pp. 374382 CrossRef
 Framinan, JM, Leisten, R, RuizUsano, R (2002) Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur J Oper Res 141: pp. 559569 CrossRef
 T’kindt, V, Billaut, JC, Proust, C (2001) Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry. Eur J Oper Res 135: pp. 4249 CrossRef
 Marler, RT, Arora, JS (2004) Survey of multiobjective optimization methods for engineering. Struct Multidisc Optim 26: pp. 369395 CrossRef
 T’kindt, V, Billaut, JC (2001) Multicriteria scheduling problems: a survey. RAIRO Oper Res 35: pp. 143163 CrossRef
 Hoogeveen, H (2005) Multicriteria scheduling. Eur J Oper Res 167: pp. 592623 CrossRef
 Nawaz, M, Enscore, E, Ham, L (1983) A heuristic for the mmachine njob flowshop sequencing problem. Omega II: pp. 9195 CrossRef
 Panneerselvam, R (2006) Simple heuristic to minimize total tardiness in a single machine scheduling problem. Int J Adv Manuf Tech 30: pp. 722726 CrossRef
 Reeves, CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22: pp. 513 CrossRef
 Rajendran, C, Ziegler, H (2004) Antcolony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155: pp. 426438 CrossRef
 Noorul Haq, A, Saravanan, M, Vivekraj, AR, Prasad, T (2006) A scatter search algorithm for general flowshop scheduling problem. Int J Adv Manuf Tech 31: pp. 731736 CrossRef
 Suman, B (2002) Multiobjective simulated annealing—a metaheuristic technique for multiobjective optimization of a constrained problem. Found Comput Decis Soc 27: pp. 171191
 Kirkpatrick, S, Gelatt, CD, Vecchi, MP (1983) Optimization by simulated annealing. Science 20: pp. 671680 CrossRef
 Eglese, RW (1990) Simulated annealing: a tool for operational research. Eur J Oper Res 46: pp. 271281 CrossRef
 Ehrgott, M, Gandibleux, X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22: pp. 425460 CrossRef
 Laarhoven, PJM, Aarts, EHL, Lenstra, JK (1992) Job shop scheduling by simulated annealing. Oper Res 40: pp. 113125 CrossRef
 Liaw, CF (1999) Applying simulated annealing to the open shop scheduling problem. IIE T 31: pp. 457465
 Dipak, L, Chakraborty, UK (2009) An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling. Int J Adv Manuf Tech 44: pp. 559569 CrossRef
 Varadharajan, TK, Rajendran, C (2005) A multiobjective simulatedannealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur J Oper Res 167: pp. 772795 CrossRef
 Suman, B, Kumar, P (2006) A survey of simulated annealing as a tool for single and multiobjective optimization. J Oper Res Soc 57: pp. 11431160 CrossRef
 Rajasekaran S (1990) On the convergence time of simulated annealing. University of Pennsylvania Department of Computer and Information Science, Technical Report no. MSCIS9089
 Bertsimas, D, Tsitsiklis, J (1993) Simulated annealing. Statistical Science 8: pp. 1015 CrossRef
 BenDaya, M, AlFawzan, M (1996) A simulated annealing approach for the onemachine mean tardiness scheduling problem. Eur J Oper Res 93: pp. 6167 CrossRef
 Parthasarathy, S, Rajendran, C (1997) A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequencedependent setup times of jobs—a case study. Prod Plan Control 8: pp. 475483 CrossRef
 Potts, CN, Wassenhove, LN (1991) Single machine tardiness sequencing heuristics. IIE T 23: pp. 346354 CrossRef
 Johnson, DS, Aragon, CR, Mcgeoch, LA, Schevon, C (1989) Optimisation by simulated annealing: an experimental valuation. Part I, graph partitioning. Oper Res 37: pp. 865891 CrossRef
 Title
 A greedy heuristic and simulated annealing approach for a bicriteria flowshop scheduling problem with precedence constraints—a practical manufacturing case
 Journal

The International Journal of Advanced Manufacturing Technology
Volume 60, Issue 912 , pp 10871098
 Cover Date
 20120601
 DOI
 10.1007/s0017001136506
 Print ISSN
 02683768
 Online ISSN
 14333015
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Flowshop scheduling
 Lexicographical optimization
 Simulated annealing
 Multicriteria scheduling
 Industry Sectors
 Authors

 Samer Hanoun ^{(1)}
 Saeid Nahavandi ^{(1)}
 Author Affiliations

 1. Centre for Intelligent Systems Research, Institute of Technology and Research Innovation, Deakin University, Victoria, Australia