Abstract
We study a problem of scheduling n jobs on a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time dependent on the position of this batch in the batch sequence. Setup times and job processing times are continuously controllable, that is, they are real-valued variables within their lower and upper bounds. A deviation of a setup time or job processing time from its upper bound is called a compression. The problem is to find a job sequence, its partition into batches, and the values for setup times and job processing times such that (a) total job completion time is minimized, subject to an upper bound on total weighted setup time and job processing time compression, or (b) a linear combination of total job completion time, total setup time compression, and total job processing time compression is minimized. Properties of optimal solutions are established. If the lower and upper bounds on job processing times can be similarly ordered or the job sequence is fixed, then O(n 3 log n) and O(n 5) time algorithms are developed to solve cases (a) and (b), respectively. If all job processing times are fixed or all setup times are fixed, then more efficient algorithms can be devised to solve the problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Potts CN and Van Wassenhove LN (1991). Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Opl Res Soc 46: 395–406.
Webster ST and Baker KR (1995). Scheduling groups of jobs on a single machine. Opns Res 43: 692–703.
Allahverdi A, Gupta JND and Aldowaisan T (1999). A review of scheduling research involving setup considerations. OMEGA 27: 219–239.
Potts CN and Kovalyov MY (2000). Scheduling with batching: a review. Eur J Opl Res 120: 228–249.
Coffman Jr EG, Jannakakis M, Magazine MJ and Santos SA (1990). Batch sizing and job sequencing on a single machine. Ann Opns Res 26: 135–147.
Shallcross D (1992). A polynomial algorithm for a one machine batching problem. Opns Res Lett 11: 213–218.
Albers S and Brucker P (1993). The complexity of one-machine batching problems. Disc Appl Maths 47: 87–107.
Williams TJ (1985). Analysis and Design of Hierarchical Control Systems with Special Reference to Steel Plant Operations. North-Holland: Amsterdam.
Janiak A (1991). Scheduling and resource allocation problems in some flow type manufacturing processes. In: Fandel G and Zapfel G (eds). Modern Production Concepts, 1991) . Springer-Verlag: Berlin, pp 404–415.
Herroelen W, Reyck BD and Demeulemeester E (1998). Resource-constrained project scheduling: a survey of recent developments. Comput and Opns Res 25: 279–302.
Biskup D and Jahnke H (2001). Common due date assignment for scheduling on a single machine with jointly reducible processing times. Int J Prod Econ 69: 317–322.
Nowicki E and Zdrzałka S (1990). A survey of results for sequencing problems with controllable processing times. Disc Appl Math 26: 271–287.
Błazewicz J et al (1996). Scheduling Computer and Manufacturing Processes. Springer: Berlin.
Vickson RG (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Trans 12: 1155–1167.
Cheng TCE, Janiak A and Kovalyov MY (1998). Bicriterion single machine scheduling with resource dependent processing times. SIAM J Optim 8: 617–630.
Janiak A and Kovalyov MY (1996). Single machine scheduling with deadlines and resource dependent processing times. Eur J Opl Res 94: 284–291.
Lee CY and Lei L (2001). Multi-project scheduling with controllable project duration and hard resource constraint: some solvable cases. Ann of Opns Res 102: 287–307.
Cheng TCE and Kovalyov MY (1995). Single machine batch scheduling with deadlines and resource dependent processing times. Opns Res Lett 17: 243–249.
Cheng TCE, Janiak A and Kovalyov MY (2001). Single machine batch scheduling with resource dependent setup and processing times. Eur J Opl Res 135: 177–183.
Ruiz Diaz FM and French S (1984). A note on SPT scheduling of a single machine with controllable processing time. Note 154, Department of Decision Theory, University of Manchester, UK.
Wilde DJ (1964). Optimum Seeking Methods. Prentice-Hall, Inc.: Englewood Cliffs, NJ, pp 10–50.
Acknowledgements
This research was supported in part by The Hong Kong Polytechnic University under Grant Number G-T246 and the Research Grant Council of Hong Kong under Grant Number PolyU 5191/01E. MY Kovalyov is also supported by INTAS under Grant Number 00-217.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ng, C., Cheng, T. & Kovalyov, M. Batch scheduling with controllable setup and processing times to minimize total completion time. J Oper Res Soc 54, 499–506 (2003). https://doi.org/10.1057/palgrave.jors.2601537
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2601537