𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A modified LPT algorithm for the two uniform parallel machine makespan minimization problem

✍ Scribed by Christos Koulamas; George J. Kyparisis

Book ID
108118547
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
188 KB
Volume
196
Category
Article
ISSN
0377-2217

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