Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43000
Title: A revision of some single-machine and m-machine flowshop scheduling problems with learning considerations
Authors: Wang, J-B
Wu, Y-B
Ji, P 
Issue Date: 2012
Source: Information sciences, 2012, v. 190, no. 1, p. 227-232
Abstract: Lee and Wu [3] introduce a scheduling model in which the job processing times are affected by both position-based and sum-of-processing-time-based learning effects simultaneously. We demonstrate by a counter-example that their main results are incorrect. We provide a revised model of the general learning effect and show that some single-machine scheduling problems are polynomially solvable under the revised model. We also show that some special cases of flowshop scheduling can be solved in polynomial time under the revised model.
Keywords: Scheduling
Single machine
Flowshop
Learning effect
Publisher: Elsevier
Journal: Information sciences 
ISSN: 0020-0255
EISSN: 1872-6291
DOI: 10.1016/j.ins.2011.10.003
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

20
Last Week
0
Last month
Citations as of Feb 15, 2020

WEB OF SCIENCETM
Citations

20
Last Week
0
Last month
Citations as of Jul 11, 2020

Page view(s)

105
Last Week
0
Last month
Citations as of Jul 12, 2020

Google ScholarTM

Check

Altmetric


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