Proportionate flow shop with controllable processing times

Proportionate flow shop with controllable processing times

0.00 Avg rating0 Votes
Article ID: iaor2001724
Country: United Kingdom
Volume: 2
Issue: 6
Start Page Number: 253
End Page Number: 265
Publication Date: Nov 1999
Journal: Journal of Scheduling
Authors: ,
Keywords: production
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.

Reviews

Required fields are marked *. Your email address will not be published.