Abstract
A static deterministic single machine scheduling problem with a common due window is considered. Job processing times are controllable to the extent that they can be reduced, up to a certain limit, at a cost proportional to the reduction. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, its size, processing time reduction as well as job earliness and tardiness. We show that the problem can be formulated as an assignment problem and thus can be solved with well-known algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, NJ, 1993.
B. Alidaee and A. Ahmadian, Two parallel machine sequencing problems involving controllable job processing times, European Journal of Operational Research 70(1993)335–341.
F.D. Anger, C.-Y. Lee and L.A. Martin-Vega, Single machine scheduling with tight windows, Research Report 86-16, Department of Industrial and Systems Engineering, University of Florida, 1986.
K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38(1990)22–36.
T.C.E. Cheng, Optimal common due-date with limited completion time deviation, Computers and Operations Research 15(1988)91–96.
T.C.E. Cheng, Z.-L. Chen and C.-L. Li, Parallel-machine scheduling with controllable processing times, submitted to IIE Transactions (1993).
B. Dickman, Y. Wilamowsky and S. Epstein, Optimal common due-date with limited completion time, Computers and Operations Research 18(1991)125–127.
H. Emmons, Scheduling to a common due date on parallel uniform processors, Naval Research Logistics 34(1987)803–810.
N. Hall, Scheduling problems with generalized due dates, IIE Transactions 18(1986)220–222.
N. Hall, W. Kubiak and S.P. Sethi, Earliness-tardiness scheduling problems II: Deviation of completion times about a restrictive common due date, Operations Research 39(1991)847–856.
N.G. Hall and M.E. Posner, Earliness-tardiness scheduling problems I: Weighted deviation of completion times about a common due date, Operations Research 39(1991)836–846.
J.J. Kanet, Minimizing the average deviation of job completion times about a common due date, Naval Research Logistics Quarterly 28(1981)643–651.
F.-J. Krämer and C.-Y. Lee, Common due window scheduling, Production and Operations Management 2(1993)262–275.
F.-J. Krämer and C.-Y. Lee, Due window scheduling for parallel machines, Mathematical and Computer Modelling 20(1994)69–89.
C.-Y. Lee, Earliness-tardiness scheduling problems with constant size of due-date window, Research Report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 1991.
I.-S. Lee, Single machine scheduling with controllable processing times: A parametric study, International Journal of Production Economics 22(1991)105–110.
S.D. Liman and S. Ramaswamy, Earliness-tardiness scheduling problems with a common delivery window, Operation Research Letter 15(1994)195–203.
S.D. Liman, S.S. Panwalkar and S. Thongmee, Determination of common due window location in a single machine scheduling problem, to appear in European Journal of Operational Research (1995).
S.D. Liman, S.S. Panwalkar and S. Thongmee, Common due window size and location determination in a single machine scheduling problem, submitted to Journal of Operations Management (1995).
E. Nowicki, An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times, European Journal of Operational Research 70(1993) 342–349.
E. Nowicki, An approximation algorithm for a single-machine scheduling problem with release times, delivery times, and controllable processing times, European Journal of Operational Research 72(1994)74–81.
E. Nowicki and S. Zdrzalka, A survey of results for sequencing problems with controllable processing times, Discrete Applied Mathematics 26(1990)271–287.
S.S. Panwalkar, M.L. Smith and A. Seidmann, Common due date assignment to minimize total penalty for the one machine scheduling problem, Operations Research 30(1982)391–399.
S.S. Panwalkar and R. Rajagopalan, Single-machine sequencing with controllable processing times, European Journal of Operational Research 59(1992)298–302.
M. Raghavachari, Scheduling problems with non-regular penalty functions — A review, Opsearch 25(1988)144–164.
S. Thongmee and S.D. Liman, Common due window size determination in a single machine scheduling problem, submitted to Journal of the Operational Research Society (1995).
R.G. Vickson, Two single machine sequencing problems involving controllable job processing times, AIIE Transactions 12(1980)258–262.
S. Zdrzalka, Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times: Worst-case analysis, Operations Research Letters 10(1991)519–523.
Rights and permissions
About this article
Cite this article
Liman, S.D., Panwalkar, S.S. & Thongmee, S. A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research 70, 145–154 (1997). https://doi.org/10.1023/A:1018965919691
Issue Date:
DOI: https://doi.org/10.1023/A:1018965919691