Abstract
This paper studies the bicriteria problem of scheduling n jobs on a serial-batching machine to minimize maximum cost and makespan simultaneously. A serial-batching machine is a machine that can handle up to b jobs in a batch and jobs in a batch start and complete respectively at the same time and the processing time of a batch is equal to the sum of the processing times of jobs in the batch. When a new batch starts, a constant setup time s occurs. We confine ourselves to the unbounded model, where b ≥ n. We present a polynomial-time algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.
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, Pacciarell 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
Graham RL, Lawler EL, Lenstra JK, Kan AHGR (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 (2008) Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Found Comput Decis Sci 33: 369–376
He C, Lin YX, Yuan JJ (2009) A DP algorighm for minimizing makespan and total completion time on a series-batching machine. Inf Process Lett 109: 603–607
Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167: 592–623
Hoogeveen JA (1996) Single-machine Scheduling to minimize a function of two or three maximum cost criteria. J Algorithms 21: 415–433
Hoogeveen JA, Van de Velde SL (1995) Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper Res Lett 17: 205–208
Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43: 692–703
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by NSFC (grant no. 11001265, 10901142).
Rights and permissions
About this article
Cite this article
He, C., Lin, H., Lin, Y. et al. Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan. Cent Eur J Oper Res 21, 177–186 (2013). https://doi.org/10.1007/s10100-011-0220-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-011-0220-9