Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
RAIRO-Oper. Res., 55 6 (2021) 3701-3714
Published online: 2021-12-14
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor
Shuguang Li, Jing Wei, Yanyue Liang, Haoxuan Shen, Vladimir Simic and Dragan PamucarCentral European Journal of Operations Research (2024)
https://doi.org/10.1007/s10100-024-00954-9
Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives
Shuguang Li, Mingsong Li and Muhammad Ijaz KhanNetworks and Heterogeneous Media 18 (4) 1678 (2023)
https://doi.org/10.3934/nhm.2023073
An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
Cheng He, Jing Wu, Jinglei Xu and Junling WangRAIRO - Operations Research 57 (2) 731 (2023)
https://doi.org/10.1051/ro/2023003
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
Cheng He, Hao Lin and Xinxin HanDiscrete Applied Mathematics 322 94 (2022)
https://doi.org/10.1016/j.dam.2022.08.001