Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10870
Title: Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions
Authors: Cheng, TCE 
Liu, CY
Lee, WC
Ji, M
Keywords: Scheduling
Single machine
Total completion time
Total tardiness
Two agents
Issue Date: 2014
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2014, v. 78, p. 66-73 How to cite?
Journal: Computers and industrial engineering 
Abstract: Scheduling with two competing agents on a single machine has become a popular research topic in recent years. Most research focuses on minimizing the objective function of one agent, subject to the objective function of the other agent does not exceed a given limit. In this paper we adopt a weighted combination approach to treat the two-agent single-machine scheduling problem. The objective that we seek to minimize is the weighted sum of the total completion time of the jobs of one agent and the total tardiness of the jobs of the other agent. We provide two branch-and-bound algorithms to solve the problem. In addition, we present a simulated annealing and two genetic algorithms to obtain near-optimal solutions. We report the results of the computational experiments conducted to test the performance of the proposed algorithms.
URI: http://hdl.handle.net/10397/10870
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2014.09.028
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

5
Last Week
1
Last month
0
Citations as of Oct 10, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Oct 17, 2017

Page view(s)

55
Last Week
4
Last month
Checked on Oct 22, 2017

Google ScholarTM

Check

Altmetric



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