The International Journal of Advanced Manufacturing Technology

, Volume 60, Issue 9, pp 1087–1098

A greedy heuristic and simulated annealing approach for a bicriteria flowshop scheduling problem with precedence constraints—a practical manufacturing case

Original Article

DOI: 10.1007/s00170-011-3650-6

Cite this article as:
Hanoun, S. & Nahavandi, S. Int J Adv Manuf Technol (2012) 60: 1087. doi:10.1007/s00170-011-3650-6


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 trade-offs 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.


Flowshop schedulingLexicographical optimizationSimulated annealingMulticriteria scheduling

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.Centre for Intelligent Systems ResearchInstitute of Technology and Research Innovation, Deakin UniversityVictoriaAustralia