Abstract
This paper discusses the recent research on decomposition techniques in single-machine scheduling. A variety of orderings between adjacent and nonadjacent jobs in an optimal scheduling are presented. A list of decomposition rules is given that enable one to solve large size instances of six single-machine models. A partition technique is also developed to determine the optimal completion times of a general earliness-tardiness model for a given arrangement of jobs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.M. Arkin and R.O. Roundy, Weighted-tardiness scheduling on parallel machines with proportional weights, Operations Research 39(1991)64–81.
F. Della Croce, W. Szwarc, R. Tadei, P. Baracco and R. Di Tullio, Minimizing the weighted sum of quadratic completion times on a single machine, Naval Research Logistics 42(1995)1263–1270.
H. Emmons, One-machine sequencing to minimize certain functions of job tardiness, Operations Research 17(1969)701–715.
E.L. Lawler, A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Annals of Discrete Mathematics 1(1977)331–342.
C.N. Potts and L.N. Van Wassenhove, A decomposition algorithm for the single machine total tardiness problem, Operations Research Letters 1(1982)177–182.
C.N. Potts and L.N. Van Wassenhove, Dynamic programming and decomposition approaches for the single machine total tardiness problem, European Journal of Operational Research 32(1987) 405–414.
T. Sen, P. Dileepan and B. Ruparel, Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach, Engineering Costs and Production Economics 18(1990)197–202.
W. Szwarc, M.E. Posner and J.J. Liu, The single machine problem with a quadratic cost function of completion times, Management Science 34(1988)1480–1488.
W. Szwarc, Parametric precedence relations in single machine scheduling, Operations Research Letters 9(1990)133–140.
W. Szwarc and J.J. Liu, Weighted tardiness single machine scheduling with proportional weights, Management Science 38(1993)626–632.
W. Szwarc, Adjacent orderings in single-machine scheduling with earliness and tardiness penalties, Naval Research Logistics 40(1993)229–243 (1993).
W. Szwarc, Single machine total tardiness problem revisited, in: Creative and Innovative Approaches to the Science of Management, ed. Y. Ijiri, Quorum Books, 1993, pp. 407–419.
W. Szwarc and S.K. Mukhopadhyay, Minimizing a quadratic cost function of waiting times in single-machine scheduling, Journal of Operational Research Society 46(1995)753–761.
W. Szwarc and S.K. Mukhopadhyay, Optimal timing schedules in earliness-tardiness single machine sequencing, Naval Research Logistics 42(1995)1109–1114.
W. Szwarc and S.K. Mukhopadhyay, Solution of the generalized Townsend single machine scheduling model, European Journal of Operational Research 91(1996)1263–1270.
W. Szwarc and S.K. Mukhopadhyay, Earliness and tardiness single machine scheduling with proportional weights, The Journal of Global Optimization 9(1996)227–236, special issue on scheduling.
W. Szwarc and S.K. Mukhopadhyay, Decomposition of the single machine total tardiness problem, Operations Research Letters 19(1996)243–250.
W. Townsend, The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution, Management Science 24(1978)530–534.
Rights and permissions
About this article
Cite this article
Szwarc, W. Decomposition in single-machine scheduling. Annals of Operations Research 83, 271–287 (1998). https://doi.org/10.1023/A:1018916215399
Issue Date:
DOI: https://doi.org/10.1023/A:1018916215399