Author:
Topaloglu Seyda,Kilincli Gamze
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Wang MY, Sethi SP, Van De Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45:702–712
2. Pan JCH (1997) A study of integer programming formulations for scheduling problems. J Oper Res Soc 28:33–41
3. Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30:109–118
4. Aytug H, Kempf K, Uzsoy R (2002) Measures of subproblem criticality in decomposition algorithms for shop scheduling. Int J Prod Res 41(5):865–882
5. Bhaskaran K, Pinedo M (1991) Dispatching. In: Salvendy G (ed) Handbook of Industrial Engineering. Wiley, New York
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献