Summary
Scheduling theory is concerned with problems of the allocation of resources to perform a set of activities in order to achieve a certain goal. The purpose of the scheduling process could be attained by finding a feasible solution of the considered problem as well as by determining the best solution in the reference to a given optimality criterion. There are a few classical performance measures broadly studied such as schedule length, mean or mean weighted flow time, maximum lateness etc. However, trying to cover more realistic problems, new parameters and criteria must be considered. The performance measure based on the amount of late work in the system is an example of such a non-classical criterion involving due dates. Classical criteria such as e.g. maximum lateness or mean tardiness calculate the penalty for late tasks with respect to the time of their completion, whereas in some applications, the penalty should be determined with the reference to the amount of the late work independently of the time of its completion. The criteria based on late work were first proposed in the context of parallel processors and then applied in a one machine scheduling problem. In the paper, new results are presented concerning general complexity of scheduling problems with the late work criteria and some special cases in the shop environment.
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., Lenstra J.K., Rinnoy Kan A.H.G. (1983) Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5, pp. 11–24.
Blazewicz J. (1984) Scheduling preemptible tasks on parallel processors with information loss, Recherche — Technique et Science Informatiques, vol. 3, No 6, pp. 415–420.
Blazewicz J., Finke G. (1987) Minimizing mean weighted execution time loss on identical and uniform processors, Information Processing Letters 24, pp. 259–263.
Blazewicz J., Ecker K., Pesch E., Schmidt G., Wȩglarz J. (1996) Scheduling Computer and Manufacturing Processes, Springer, Heidelberg.
Brucker P. (1995) Scheduling Algorithms, Springer, Heidelberg.
Garey M.R., Johnson D.S. (1979) Computers and Intractability, W.H. Freeman and Co.
Gonzales T., Sahni S. (1976) Open shop scheduling to minimize finish time, Journal of the ACM 23, pp. 665–679.
Graham R.L., Lawler E.L., Lenstra J.K., Rinnoy Kan A.H.G. (1979) Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Annals of Discrete Maths. 5, pp. 287–326.
Johnson S.M. (1954) Optimal two-and-three-stage production schedules, Naval Res. Logist. Quart. 1, pp. 61–68.
Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. (1977) Complexity of machine scheduling problems, Annals of Discrete Mathematics 1, pp. 343–362.
Potts C.N., Van Wassenhove L.N. (1991) Single machine scheduling to minimize total late work, Operations Research, vol. 40, No. 3, pp. 586–595.
Potts C.N., Van Wassenhove L.N. (1992) Approximation algorithms for scheduling a single machine to minimize total late work, Operations Research Letters 11, pp. 261–266.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Błażewicz, J., Pesch, E., Sterna, M., Werner, F. (2000). Total Late Work Criteria for Shop Scheduling Problems. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-58300-1_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67094-0
Online ISBN: 978-3-642-58300-1
eBook Packages: Springer Book Archive