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