This paper considers a class of simultaneous optimization scheduling with two competitive agents on an unbounded serial-batching machine. The cost function of each agent depends on the completion times of its jobs only. According to whether the jobs from different agents can be processed in a common batch, compatible model and incompatible model are investigated. For the incompatible model, we consider batch availability and item availability. For each problem, we provide a polynomial-time algorithm that can find all Pareto optimal schedules.
Accepté le :
Première publication :
Publié le :
DOI : 10.1051/ro/2021175
Keywords: Serial-batching, two-agent scheduling, compatible/incompatible, batch/item availability
@article{RO_2021__55_6_3701_0,
author = {He, Cheng and Li, Shi-Sheng and Wu, Jing},
title = {Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine},
journal = {RAIRO. Operations Research},
pages = {3701--3714},
year = {2021},
publisher = {EDP-Sciences},
volume = {55},
number = {6},
doi = {10.1051/ro/2021175},
mrnumber = {4350871},
zbl = {1486.90092},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2021175/}
}
TY - JOUR AU - He, Cheng AU - Li, Shi-Sheng AU - Wu, Jing TI - Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine JO - RAIRO. Operations Research PY - 2021 SP - 3701 EP - 3714 VL - 55 IS - 6 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2021175/ DO - 10.1051/ro/2021175 LA - en ID - RO_2021__55_6_3701_0 ER -
%0 Journal Article %A He, Cheng %A Li, Shi-Sheng %A Wu, Jing %T Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine %J RAIRO. Operations Research %D 2021 %P 3701-3714 %V 55 %N 6 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2021175/ %R 10.1051/ro/2021175 %G en %F RO_2021__55_6_3701_0
He, Cheng; Li, Shi-Sheng; Wu, Jing. Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine. RAIRO. Operations Research, Tome 55 (2021) no. 6, pp. 3701-3714. doi: 10.1051/ro/2021175
[1] , , and , Scheduling problems with two competing agents. Oper. Res. 52 (2004) 229–242. | MR | Zbl | DOI
[2] , , , and , Multiagent Scheduling: Models and Algorithms. Springer-Verlag (2014). | MR | Zbl | DOI
[3] and , The complexity of one-machine batching problems. Discrete Appl. Math. 47 (1993) 87–107. | MR | Zbl | DOI
[4] , The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246 (2015) 345–378. | MR | Zbl | DOI
[5] and , A multiple-criterion model for machine scheduling. J. Scheduling 6 (2003) 7–16. | MR | Zbl | DOI
[6] , , and , Batch sizing and job sequencing on a single machine. Ann. Oper. Res. 26 (1990) 135–147. | MR | Zbl | DOI
[7] , and , Pareto optimization of serial-batching scheduling problems on two agents. In: The 2011 International Conference on Advanced Mechatronic Systems. IEEE (2011).
[8] , and , Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Appl. Math. Comput. 332 (2018) 1–18. | MR | Zbl
[9] and , Improved algorithms for two-agent scheduling on an unbounded serial-batching machine. Discrete Optim. 41 (2021) 100655. | MR | Zbl | DOI
[10] , and , Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine. Found. Comput. Decis. Sci. 33 (2008) 369–376. | MR | Zbl
[11] , and , A DP algorighm for minimizing makespan and total completion time on a series-batching machine. Inf. Process. Lett. 109 (2009) 603–607. | MR | Zbl | DOI
[12] , and , Serial-batching scheduling with two agents to minimize makespan and maximum cost. J. Scheduling 23 (2020) 609–617. | MR | Zbl | DOI
[13] , Multicriteria scheduling. Eur. J. Oper. Res. 167 (2005) 592–623. | MR | Zbl | DOI
[14] , and , Two-agent scheduling with agent specific batches on an unbounded serial batching machine. J. Scheduling 18 (2015) 423–434. | MR | Zbl | DOI
[15] , and , Scheduling two job families on a single machine with two competitive agents. J. Comb. Optim. 32 (2016) 784–799. | MR | Zbl | DOI
[16] , , and , Two-agent scheduling on a single sequential and compatible batching machine. Nav. Res. Logistics 64 (2017) 628–641. | MR | Zbl | DOI
[17] and , On the complexity of scheduling with batch setup times. Oper. Res. 37 (1989) 798–804. | MR | Zbl | DOI
[18] and , A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems. Eur. J. Oper. Res. 235 (2014) 1–16. | MR | Zbl | DOI
[19] and , Scheduling with batching: a review. Eur. J. Oper. Res. 120 (2000) 228–249. | MR | Zbl | DOI
[20] and , Scheduling groups of jobs on a single machine. Oper. Res. 43 (1995) 692–703. | MR | Zbl | DOI
[21] , , and and , Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92 (2016) 16–30. | DOI
[22] , , , and , Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Nav. Res. Logistics 65 (2018) 393–409. | MR | Zbl | DOI
[23] , , and , Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann. Oper. Res. 298 (2021) 497–523. | MR | Zbl | DOI
[24] , and , Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280 (2020) 860–875. | MR | Zbl | DOI
Cité par Sources :
