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

A heuristic to minimize total flow time in permutation flow shop

โœ Scribed by Dipak Laha; Subhash C. Sarin

Book ID
113830649
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
131 KB
Volume
37
Category
Article
ISSN
0305-0483

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristics for minimizing total weighted
Heuristics for minimizing total weighted tardiness in flexible flow shops
โœ Ya Yang; Stephan Kreipl; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 156 KB ๐Ÿ‘ 1 views

Consider a #exible #ow shop with s stages in series and at each stage a number of identical machines in parallel. There are n jobs to be processed and each job has to go through the stages following the same route. Job j has release date r H , due date d H , weight w H and a processing time p HJ at