Please use this identifier to cite or link to this item:
Title: Proportionate flow shop with controllable processing times
Authors: Cheng, TCE 
Shakhlevich, N
Keywords: Controllable processing times
Flow shop scheduling
Multiple criteria
Issue Date: 1999
Publisher: Springer
Source: Journal of scheduling, 1999, v. 2, no. 6, p. 253-265 How to cite?
Journal: Journal of scheduling 
Abstract: This paper considers a special class of flow-shop problems, known as the proportionate flow shop. In such a shop, each job flows through the machines in the same order and has equal processing times on the machines. The processing times of different jobs may be different. It is assumed that all operations of a job may be compressed by the same amount which will incur an additional cost. The objective is to minimize the makespan of the schedule together with a compression cost function which is non-decreasing with respect to the amount of compression. For a bicriterion problem of minimizing the makespan and a linear cost function, an O(n log n) algorithm is developed to construct the Pareto optimal set. For a single criterion problem, an O(n2) algorithm is developed to minimize the sum of the makespan and compression cost.
ISSN: 1094-6136
EISSN: 1099-1425
Appears in Collections:Journal/Magazine Article

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


Last Week
Last month
Citations as of Feb 12, 2018

Page view(s)

Last Week
Last month
Citations as of Feb 19, 2018

Google ScholarTM


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