Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20695
Title: A permutation flow-shop scheduling problem with convex models of operation processing times
Authors: Cheng, TCE 
Janiak, A
Issue Date: 2000
Publisher: Springer
Source: Annals of operations research, 2000, v. 96, no. 1-4, p. 39-60 How to cite?
Journal: Annals of operations research 
Abstract: The paper is an extension of the classical permutation flow-shop scheduling problem to the case where some of the job operation processing times are convex decreasing functions of the amounts of resources (e.g., financial outlay, energy, raw material) allocated to the operations (or machines on which they are performed). Some precedence constraints among the jobs are given. For this extended permutation flow-shop problem, the objective is to find a processing order of the jobs (which will be the same on each machine) and an allocation of a constrained resource so as to minimize the duration required to complete all jobs (i.e., the makespan). A computational complexity analysis of the problem shows that the problem is NP-hard. An analysis of the structure of the optimal solutions provides some elimination properties, which are exploited in a branch-and-bound solution scheme. Three approximate algorithms, together with the results of some computational experiments conducted to test the effectiveness of the algorithms, are also presented.
URI: http://hdl.handle.net/10397/20695
ISSN: 0254-5330
EISSN: 1572-9338
DOI: 10.1023/A:1018943300630
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Dec 1, 2018

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of Dec 5, 2018

Page view(s)

97
Last Week
0
Last month
Citations as of Dec 9, 2018

Google ScholarTM

Check

Altmetric


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