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

Makespan minimization in online scheduling with machine eligibility

โœ Scribed by Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo

Publisher
Springer
Year
2010
Tongue
English
Weight
518 KB
Volume
8
Category
Article
ISSN
1619-4500

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