Abstract
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.
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
Blazewicz, J.: Scheduling Preemptible Tasks on Parallel Processors with Information Loss. Recherche Technique et Science Informatiques 3/6, 415–420 (1984)
Blazewicz, J., Finke, G.: Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Information Processing Letters 24, 259–263 (1987)
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)
Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Open Shop Scheduling Problems with Late Work Criteria. Discrete Applied Mathematics 134, 1–24 (2004)
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)
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)
Johnson, S.M.: Optimal Two- and Three-Stage Production Schedules. Naval Research Logistics Quarterly 1, 61–68 (1954)
Kowalski, K.: Scheduling Algorithms for the Shop Scheduling Problems with the Late Work Criteria, Master Thesis, Poznan University of Technology (2003) (in Polish)
Potts, C.N., van Wassenhove, L.N.: Single Machine Scheduling to Minimize Total Late Work. Operations Research 40/3, 586–595 (1991)
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)
Sterna, M.: Problems and Algorithms in Non-Classical Shop Scheduling. Scientific Publishers of the Polish Academy of Sciences, Poznan (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blazewicz, J., Pesch, E., Sterna, M., Werner, F. (2004). Flow Shop Scheduling with Late Work Criterion – Choosing the Best Solution Strategy. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds) Applied Computing. AACC 2004. Lecture Notes in Computer Science, vol 3285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30176-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30176-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23659-7
Online ISBN: 978-3-540-30176-9
eBook Packages: Springer Book Archive