Please use this identifier to cite or link to this item:
Title: A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect
Authors: Wu, WH
Yin, YQ
Cheng, TCE 
Lin, WC
Chen, JC
Luo, SY
Wu, CC
Keywords: Agent scheduling
Genetic algorithm
Simulated annealing
Sum-of-processing-times-based learning effect
Branch-and-bound algorithm
Issue Date: 2017
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2017, v. 68, no. 2, p. 111-120 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: This paper considers a scheduling model involving two agents, job release times, and the sum-of-processingtimes-based learning effect. The sum-of-processing-times-based learning effect means that the actual processing time of a job of either agent is a decreasing function of the sum of the processing times of the jobs already scheduled in a given schedule. The goal is to seek for an optimal schedule that minimizes the total weighted completion time of the first agent, subject to no tardy job for the second agent. We first provide a branch-andbound method to solve the problem. We then develop an approach that combines genetic algorithm and simulated annealing to seek for approximate solutions for the problem. We carry on extensive computational tests to assess the performance of the proposed algorithms.
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/s41274-016-0008-3
Appears in Collections:Journal/Magazine Article

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


Last Week
Last month
Citations as of Nov 16, 2017

Page view(s)

Last Week
Last month
Checked on Nov 19, 2017

Google ScholarTM



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