Author:
Goyal Bharat,Kaur Sukhmandeep
Reference12 articles.
1. J.N.D. Gupta, Optimal schedules for special structure flow shops, US. Postal Service, Washington, DC, 1975, pp. 255–269.
2. Special cases of the flow-shop problem;Szwarc;Nav. Res. Logist.,1977
3. Computers and Intractability: A Guide to the theory of NP- Completeness;Garey,1979
4. n-job, two machine flow-job shop scheduling problem having minimum total waiting time for all jobs;Bhatnagar;PAMS,1979
5. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem;Nawaz;Omega,1983
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献