Author:
Panwalkar S.S.,Koulamas Christos
Subject
General Engineering,General Computer Science
Reference19 articles.
1. Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops;Benavides;Computers & Operations Research,2016
2. On J-maximal and J-minimal flow shop schedules;Chin;Journal of the ACM,1981
3. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed;Choi;European Journal of Operational Research,2007
4. Theory of scheduling;Conway,1967
5. Flow shop scheduling: Theoretical results, algorithms and application;Emmons,2012
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献