Abstract
We consider a nonpreemptive single machine common due window scheduling problem where the job processing times are controllable with linear costs and the due window is movable. The objective is to find a job sequence, a processing time for each job, and a position of the common due window to minimize the total cost of weighted earliness/tardiness and processing time compression. We discuss some properties of the optimal solutions and provide a polynomial time algorithm to solve the problem.
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
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Alidaee, B., Kochenberger, G.A.: A framework for machine scheduling problems with controllable processing times. Production and Operations Management 5, 391–405 (1996)
Baker, K., Scudder, G.: Sequencing with earliness and tardiness penalties: A review. Operations Research 38, 22–36 (1990)
Biskup, D., Jahnke, H.: Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics 69, 317–322 (2001)
Cheng, T.C.E.: Optimal common due-date with limited completion time deviation. Computers and Operations Research 15, 91–96 (1988)
Daniels, R.L., Sarin, R.K.: Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research 37, 981–984 (1989)
Dickman, B., Wilamowsky, Y., Epstain, S.: Optimal common due-date with limited completion time. Computers and Operations Research 39, 125–127 (1991)
Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problems (I). Operations Research 39, 836–846 (1991)
Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problems (II). Operations Research 39, 847–856 (1991)
Jansen, K., Mastrolilli, M., Solis-Oba, R.: Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167, 297–319 (2005)
Kanet, J.J.: Minimize the average deviation of job completion times about a common due date. Naval Research Logistics 28, 643–651 (1981)
Kaspi, M., Shabtay, D.: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers and Operations Research 33, 3015–3033 (2006)
Kramer, F.J., Lee, C.Y.: Common due window scheduling. Production and Operations Management 2, 262–275 (1993)
Kramer, F.J., Lee, C.Y.: Due window scheduling for parallel machines. Mathematics and Computer Modelling 20, 69–89 (1994)
Lee, C.Y.: Earliness-tardiness scheduling problems with constant size of due window. Research Report, Dept. of Industrial and Systems Engineering, University of Florida (1991)
Liman, S.D., Rawaswamy, S.: Earliness-tardiness scheduling problems with a common delivery window. Operations Research Letters 15, 195–203 (1994)
Liman, S.D., Panwalkar, S.S., Thongmee, S.: Determination of common due window location in a single machine scheduling problem. European Journal of Operational Research 93, 68–74 (1996)
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)
Liman, S.D., Panwalkar, S.S., Thongmee, S.: Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society 49, 1007–10 (1998)
Ng, C.T., Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals of Operations Research 133, 163–174 (2005)
Nowicki, E., Zdrzalka, S.: A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics 26, 271–287 (1990)
Panwalkar, S.S., Rajagopalan, R.: Single machine sequencing with controllable processing times. European Journal of Operational Research 59, 298–302 (1992)
Panwalkar, S.S., Smith, M.L., Seidmann, A.: Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 30, 391–399 (1982)
Thongmee, S., Liman, S.D.: Common due window size determination in a single machine scheduling problem. Research Report, Dept. of Industrial Engineering, Texas Tech. University (1995)
Vickson, R.G.: Two single machine sequencing problem involving controllable job processing times. AIIE Transactions 12, 258–262 (1980a)
Vickson, R.G.: Choosing the sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research 28, 1155–1167 (1980b)
Van Wassenhove, L.N., Baker, K.: A Bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research 11, 48–54 (1982)
Wan, G., Yen, B.P.C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research 142, 271–281 (2002)
Weng, M.X., Ventura, J.A.: A note on Common due window Scheduling. Production and Operations Management 5, 194–200 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wan, G. (2007). Single Machine Common Due Window Scheduling with Controllable Job Processing Times. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)