EJOR-D-15-00455-accepted.pdf (448.01 kB)
Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
journal contribution
posted on 2017-07-06, 14:58 authored by Lixin Tang, Xiaoli Zhao, Jiyin LiuJiyin Liu, Joseph Y.-T. LeungWe consider a scheduling problem in which the jobs are generated by two agents and have time-dependent proportional-linear deteriorating processing times. The two agents compete for a common single batching machine to process their jobs, and each agent has its own criterion to optimize. The jobs may have identical or different release dates. The batching machine can process several jobs simultaneously as a batch and the processing time of a batch is equal to the longest of the job processing times in the batch. The problem is to determine a schedule for processing the jobs such that the objective of one agent is minimized, while the objective of the other agent is maintained under a fixed value. For the unbounded model, we consider various combinations of regular objectives on the basis of the compatibility of the two agents. For the bounded model, we consider two different objectives for incompatible and compatible agents: minimizing the makespan of one agent subject to an upper bound on the makespan of the other agent and minimizing the number of tardy jobs of one agent subject to an upper bound on the number of tardy jobs of the other agent. We analyze the computational complexity of various problems by either demonstrating that the problem is intractable or providing an efficient exact algorithm for the problem. Moreover, for certain problems that are shown to be intractable, we provide efficient algorithms for certain special cases.
Funding
This research is supported by the National Key Research and Development Program of China (2016YFB0901905), the Fund for Innovative Research Groups of the National Natural Science Foundation of China (Grant 71621061), the Major International Joint Research Project of the National Natural Science Foundation of China (Grant 71520107004), the Fund for 111 Project (B16009).
History
School
- Business and Economics
Department
- Business
Published in
European Journal of Operational ResearchCitation
TANG, L. ... et al, 2017. Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research, 263 (2), pp. 401-411.Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Acceptance date
2017-05-11Publication date
2017Notes
This paper was accepted for publication in the journal European Journal of Operational Research and the definitive published version is available at https://doi.org/10.1016/j.ejor.2017.05.019ISSN
0377-2217Publisher version
Language
- en