๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling a two-stage flowshop under makespan constraint

โœ Scribed by Milind Dawande; Srinagesh Gavirneni; Ram Rachamadugu

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
377 KB
Volume
44
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Makespan minimization in the two-machine
Makespan minimization in the two-machine flowshop batch scheduling problem
โœ T.C.E. Cheng; B.M.T. Lin; A. Toker ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

Complexity and algorithms for two-stage
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
โœ Jinxing Xie; Xijun Wang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 519 KB

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem