Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
Joint Authors
Shiau, Yau-Ren
Chung, Yu-Hsiang
Ding, Lawson
Lee, Wen Chiung
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-01-19
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent.
A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions.
Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.
American Psychological Association (APA)
Lee, Wen Chiung& Shiau, Yau-Ren& Chung, Yu-Hsiang& Ding, Lawson. 2014. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1050261
Modern Language Association (MLA)
Lee, Wen Chiung…[et al.]. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents. The Scientific World Journal No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-1050261
American Medical Association (AMA)
Lee, Wen Chiung& Shiau, Yau-Ren& Chung, Yu-Hsiang& Ding, Lawson. Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1050261
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1050261