Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19047
Title: Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time
Authors: Shiau, YR
Tsai, MS
Lee, WC
Cheng, TCE 
Keywords: Learning effects
Scheduling
Total completion time
Two agent
Two-machine flowshop
Issue Date: 2015
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2015, v. 87, p. 580-589 How to cite?
Journal: Computers and industrial engineering 
Abstract: We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions.
URI: http://hdl.handle.net/10397/19047
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2015.05.032
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Nov 7, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Nov 17, 2017

Page view(s)

47
Last Week
1
Last month
Checked on Nov 12, 2017

Google ScholarTM

Check

Altmetric



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