Heuristic algorithms for preemptive sche
โ
Ewa Figielska
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 464 KB
This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at both the stages. The resource requirements are of a 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Four heuristic algorithm