Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/75933
Title: Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval
Authors: Yin, YQ
Wang, WY
Wang, DJ
Cheng, TCE 
Keywords: Scheduling
Multiple agents
DIF due date assignment
Dynamic programming
Issue Date: 2017
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2017, v. 111, p. 202-215 How to cite?
Journal: Computers and industrial engineering 
Abstract: We consider the problem of scheduling n nonresumable and simultaneously available jobs on a single machine with several agents. Each job belongs to one of the agents, each of which competes for the use of the machine to process its own jobs to meet its own scheduling criterion. The machine has a fixed interval during which it is unavailable to process the jobs. The due dates of the last agent's jobs are decision variables, which are determined by the unrestricted (different) due date assignment model, while the due dates of each of the other agents' jobs are given in advance. The last agent wishes to minimize the sum of the due date assignment cost and weighted number of its tardy jobs, while each of the other agents seeks to minimize the maximum value of a regular scheduling function of its jobs, the total completion time of its jobs, or the weighted number of its tardy jobs. The overall objective is to minimize the last agent's criterion, while keeping each of the other agents' criterion values no greater than a given limit. We analyze the computational complexity, and devise pseudo-polynomial dynamic programming (DP) solution algorithms and mixed integer linear programming (MILP) formulations for the considered problems. Finally, we compare the performance of the DP solution algorithms against the corresponding MILP formulations with randomly generated instances.
URI: http://hdl.handle.net/10397/75933
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2017.07.013
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Google ScholarTM

Check

Altmetric


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