Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29891
Title: Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
Authors: Wang, JB
Ji, P 
Cheng, TCE 
Wang, D
Keywords: Branch-and-bound algorithm
Deteriorating jobs
Flow shop
Learning effect
Makespan
Scheduling
Issue Date: 2012
Publisher: Springer
Source: Optimization letters, 2012, v. 6, no. 7, p. 1393-1409 How to cite?
Journal: Optimization letters 
Abstract: We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms.
URI: http://hdl.handle.net/10397/29891
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-011-0334-y
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

16
Last Week
0
Last month
1
Citations as of Nov 15, 2017

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
1
Citations as of Nov 16, 2017

Page view(s)

69
Last Week
1
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



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