Abstract
This paper studies a hierarchical optimization problem on an unbounded parallel-batching machine, in which two objective functions are maximum lateness induced by two sets of due dates, representing different purposes of two decision-makers. By a hierarchical optimization problem, we mean the problem of optimizing the secondary criterion under the constraint that the primary criterion is optimized. A parallel-batching machine is a machine that can handle several jobs in a batch in which all jobs start and complete respectively at the same time. We present an \(O(n\log P)\)-time algorithm and an \(O(n^3)\)-time algorithm for this hierarchical scheduling problem, where P is the total processing time of all jobs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agnetis A, Mirchani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242
Baker KR, Smith JC (2003) A multiple-criterion model for machine scheduling. J Sched 6:7–16
Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin
Brucker P, Gladky A, Hoogeveen H, Kovalyov MY, Potts CN, Tautenhahn T, Van De Velde SL (1998) Scheduling a batching machine. J Sched 1:31–54
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
He C, Lin YX, Yuan JJ (2007) Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theoret Comput Sci 381:234–240
He C, Lin YX, Yuan JJ (2010) Some improved algorithms on the single machine hierarchical scheduling with total tardiness as the primary criterion. Asia Pacific J Oper Res 27(5):577–585
He C, Lin YX, Yuan JJ (2010) A note on the single machine scheduling to minimize the number of tardy jobs with deadline. Eur J Oper Res 201:966–970
Hoogeveen JA (1996) Single-machine scheduling to minimize a function of two or three maximum cost criteria. J Algorithms 21:415–433
Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623
Wagelmans APM, Gerodimos AE (2000) Improved dynamic programs for some batching problems involving the maximum lateness criterion. Oper Res Lett 27:109–118
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by NSFC (Grant No. 11201121, 11571323) and CSC (201309895008) and young backbone teachers of Henan colleges (2013GGJS-079).
Rights and permissions
About this article
Cite this article
He, C., Lin, H. Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness. 4OR-Q J Oper Res 14, 153–164 (2016). https://doi.org/10.1007/s10288-015-0299-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-015-0299-2