Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16482
Title: Several flow shop scheduling problems with truncated position-based learning effect
Authors: Wang, XY
Zhou, Z
Zhang, X
Ji, P 
Wang, JB
Keywords: Flow shop
Heuristic algorithm
Learning effect
Regular performance criteria
Scheduling
Worst-case analysis
Issue Date: 2013
Publisher: Pergamon Press
Source: Computers and operations research, 2013, v. 40, no. 12, p. 2906-2929 How to cite?
Journal: Computers and operations research 
Abstract: The concept of truncated position-based learning process plays a key role in production environments. However, it is relatively unexplored in the flow shop setting. In this paper, we consider the flow shop scheduling with truncated position-based learning effect, i.e., the actual processing time of a job is a function of its position and a control parameter in a processing permutation. The objective is to minimize one of the six regular performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the discounted total weighted completion time, the sum of the quadratic job completion times, and the maximum lateness. We present heuristic algorithms and analyze the worst-case bound of these heuristic algorithms. We also provide the computational results to evaluate the performance of the heuristics.
URI: http://hdl.handle.net/10397/16482
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2013.07.001
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

18
Last Week
0
Last month
1
Citations as of Aug 14, 2017

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

34
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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