Abstract
We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can be polynomially transformed into the single-machine GCT-scheduling with a special setting of generated completion times. In the GCT-scheduling, a sequence of completion times is given in advance and the job scheduled at the i-th position will be assigned the i-th completion time. We present a comprehensive study on the complexities of the bicriteria single-machine GCT-scheduling problems with respect to various regular criteria. We then turn these complexity results into the forms of bicriteria scheduling of equal length jobs on uniform (or identical) parallel machines. Our research generalizes the existing results on bicriteria scheduling of equal length jobs in the literature. Particularly, one of our results solves the open problem posed by Sarin and Prakash (J Comb Optim 8:227–240, 2004), which asks for minimizing the total weighted completion time subject to the optimality of minimizing the total number of tardy jobs on identical parallel machines, and we show that this problem is solvable in polynomial time.
Similar content being viewed by others
References
Agnetis A, Billaut JC, Gawiejnowicz S, Pacciarelli D, Soukhal A (2014) Multiagent scheduling: models and algorithms. Springer, Berlin
Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242
Chen RB, Yuan JJ, Lu LF (2019) Single-machine scheduling with positional due indices and positional deadlines. Discrete Optim. https://doi.org/10.1016/j.disopt.2019.06.002
Dessouky MI, Lageweg BJ, Lenstra JK, Van de Velde SL (1990) Scheduling identical jobs on uniform parallel machines. Stat Neerl 44:115–123
Elvikis D, Hamacher HW, T’kindt V (2011) Scheduling two agents on uniform parallel machines with makespan and cost functions. J Sched 14:471–481
Elvikis D, T’kindt V (2014) Two-agent scheduling on uniform parallel machines with min–max criteria. Ann Oper Res 213:79–94
Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623
Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York
Oron D, Shabtay D, Steiner G (2015) Single machine scheduling with two competing agents and equal job processing times. Eur J Oper Res 244:86–99
Sadi F, Soukhal A (2017) multi-agent scheduling problems with a global agent and equal length jobs. Discrete Optim 23:93–104
Sarin SC, Prakash D (2004) Equal processing time bicriteria scheduling on parallel machines. J Comb Optim 8:227–240
Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 1:59–66
T’kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin
Tuzikov A, Makhaniok M, Manner R (1998) Bicriterion scheduling of identical processing time jobs by uniform processors. Comput Oper Res 25:31–35
Wan L, Du JZ, Lai KK (2019) CO-agent scheduling to minimize total weighted completion time and total weighted number of tardy jobs with unit processing times. In submission
Acknowledgements
The authors would like to thank the Associate Editor and two anonymous referees for their constructive comments and helpful suggestions. This research was supported by NSFC (11801266) and NSFC (11671368).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhao, Q., Yuan, J. Bicriteria scheduling of equal length jobs on uniform parallel machines. J Comb Optim 39, 637–661 (2020). https://doi.org/10.1007/s10878-019-00507-w
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00507-w