Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy

  • Jacek Blazewicz
  • Erwin Pesch
  • Malgorzata Sterna
  • Frank Werner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3285)


In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with the weighted late work criterion, i.e. F2|di= d|Yw, which is known to be NP-hard. In computational experiments, we compared the practical efficiency of a dynamic programming approach, an enumerative method and heuristic procedures. Test results showed that each solution method has its advantages and it cannot be rejected from the consideration a priori.


Flow Shop Schedule Problem Enumerative Method Machine Flow Shop Late Work Criterion List Schedule Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blazewicz, J.: Scheduling Preemptible Tasks on Parallel Processors with Information Loss. Recherche Technique et Science Informatiques 3/6, 415–420 (1984)MathSciNetGoogle Scholar
  2. 2.
    Blazewicz, J., Finke, G.: Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Information Processing Letters 24, 259–263 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Total Late Work Criteria for Shop Scheduling Problems. In: Inderfurth, K., Schwoediauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Waescher, G. (eds.) Operations Research Proceedings 1999, pp. 354–359. Springer, Heidelberg (2000)Google Scholar
  4. 4.
    Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Open Shop Scheduling Problems with Late Work Criteria. Discrete Applied Mathematics 134, 1–24 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: The Two-Machine Flow-Shop Problem with Weighted Late Work Criterion and Common Due Date. European Journal of Operational Research (2004) (to appear)Google Scholar
  6. 6.
    Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Revenue Management in a Job-Shop: a Dynamic Programming Approach. Preprint Nr. 40/03, Otto-von-Guericke-University Magdeburg (2003)Google Scholar
  7. 7.
    Johnson, S.M.: Optimal Two- and Three-Stage Production Schedules. Naval Research Logistics Quarterly 1, 61–68 (1954)CrossRefGoogle Scholar
  8. 8.
    Kowalski, K.: Scheduling Algorithms for the Shop Scheduling Problems with the Late Work Criteria, Master Thesis, Poznan University of Technology (2003) (in Polish)Google Scholar
  9. 9.
    Potts, C.N., van Wassenhove, L.N.: Single Machine Scheduling to Minimize Total Late Work. Operations Research 40/3, 586–595 (1991)Google Scholar
  10. 10.
    Potts, C.N., van Wassenhove, L.N.: Approximation Algorithms for Scheduling a Single Machine to Minimize Total Late Work. Operations Research Letters 11, 261–266 (1991)CrossRefGoogle Scholar
  11. 11.
    Sterna, M.: Problems and Algorithms in Non-Classical Shop Scheduling. Scientific Publishers of the Polish Academy of Sciences, Poznan (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jacek Blazewicz
    • 1
  • Erwin Pesch
    • 2
  • Malgorzata Sterna
    • 1
  • Frank Werner
    • 3
  1. 1.Institute of Computing SciencePoznan University of TechnologyPoznanPoland
  2. 2.Institute of Information Systems, FB 5 – Faculty of EconomicsUniversity of SiegenSiegenGermany
  3. 3.Faculty of MathematicsOtto-von-Guericke-UniversityMagdeburgGermany

Personalised recommendations