Scheduling flowshops with finite buffers
โ
Bryan A Norman
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 145 KB
In this paper we explore ยฏowshop scheduling problems containing both sequence-dependent setup times and ยฎnite buers. To the best of our knowledge, problems containing both of these complexities have not been addressed previously in the literature. The problem is clearly NP-hard and therefore we only