A note on weighted completion time minimization in a flexible flow shop

Authors:
George J. Kyparisis;Christos Koulamas
Affiliations:
Department of Dec. Sc. and Info Systems, College of Business Administration, Florida International University, University Park Campus, Miami, FL 33199, USA;Department of Dec. Sc. and Info Systems, College of Business Administration, Florida International University, University Park Campus, Miami, FL 33199, USA
Venue:
Operations Research Letters
Year:
2001

Citing 3
Cited 2

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the flexible flow shop scheduling problem with the weighted completion time minimization objective. We show that an extension of the weighted shortest processing time heuristic to the flexible flow shop case yields a worst-case ratio bound for this problem. A sharper bound is obtained for either the unweighted case or the case where there is a single machine in at least one stage.