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

A new heuristic for minimizing total completion time objective in permutation flow shop scheduling

โœ Scribed by Dipak Laha; Arindam Chakravorty

Publisher
Springer
Year
2010
Tongue
English
Weight
155 KB
Volume
53
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing total weighted completion tim
Minimizing total weighted completion time in a proportionate flow shop
โœ Natalia Shakhlevich; Han Hoogeveen; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Springer US ๐ŸŒ English โš– 127 KB ๐Ÿ‘ 1 views

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to p H ; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criter