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

An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling

โœ Scribed by Dipak Laha; Uday K. Chakraborty

Publisher
Springer
Year
2007
Tongue
English
Weight
160 KB
Volume
38
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient heuristic for scheduling in
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
โœ Chandrasekharan Rajendran; Hans Ziegler ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 640 KB

The problem of scheduling in a flowshop is considered with the objective of minimizing the total weighted flowtime of jobs. A heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling