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

Preemptive multiprocessor order scheduling to minimize total weighted flowtime

โœ Scribed by Joseph Y.-T. Leung; C.Y. Lee; C.W. Ng; G.H. Young


Book ID
108118406
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
199 KB
Volume
190
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient heuristic for scheduling in
โœ 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