Volume 55, Number 6, November-December 2021
|Page(s)||3701 - 3714|
|Published online||14 December 2021|
Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
School of Science, Henan University of Technology, Zhengzhou 450001, P.R. China
2 Department of Information and Computation Science, Zhongyuan University of Technology, Zhengzhou 450007, P.R. China
* Corresponding author: email@example.com
Accepted: 21 November 2021
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.
Mathematics Subject Classification: 90C27 / 90B35
Key words: Serial-batching / two-agent scheduling / compatible/incompatible / batch/item availability
© The authors. Published by EDP Sciences, ROADEF, SMAI 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.