Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/25722

Title: Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
Authors: Tang, Lixin
Zhao, Xiaoli
Liu, Jiyin
Leung, Joseph Y.-T.
Keywords: Scheduling
Release dates
Agent scheduling
Issue Date: 2017
Publisher: © Elsevier
Citation: 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.
Abstract: We 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.
Description: This paper is closed access until 26th May 2019.
Sponsor: 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).
Version: Accepted for publication
DOI: 10.1016/j.ejor.2017.05.019
URI: https://dspace.lboro.ac.uk/2134/25722
Publisher Link: https://doi.org/10.1016/j.ejor.2017.05.019
ISSN: 0377-2217
Appears in Collections:Closed Access (Business)

Files associated with this item:

File Description SizeFormat
EJOR-D-15-00455-accepted.pdfAccepted version448.01 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.