Series production in a basic re-entrant shop to minimize makespan or total flow time
暂无分享,去创建一个
Feng Chu | Chengbin Chu | Caroline Desprez | C. Chu | F. Chu | C. Desprez
[1] Toshihide Ibaraki,et al. Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .
[2] Hiroshi Kise,et al. ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .
[3] Jen-Shiang Chen,et al. A branch and bound procedure for the reentrant permutation flow-shop scheduling problem , 2006 .
[4] J.-S. Chen,et al. Minimizing makespan in re-entrant permutation flow-shops , 2003, J. Oper. Res. Soc..
[5] Wieslaw Kubiak,et al. Mean Flow Time Minimization in Reentrant Job Shops with a Hub , 1996, Oper. Res..
[6] J. B. Butcher. Integrated Circuit Fabrication Technology, A. Veronis. Prentice Hall (1979), 193pp £12.30 , 1979 .
[7] M. Y. Wang,et al. Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..
[8] Konstantin Kogan,et al. Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects , 1995 .
[9] P. J. W. Noble. Printed circuit board assembly: The Complete Works , 1989 .
[10] George Steiner,et al. Scheduling in Reentrant Robotic Cells: Algorithms and Complexity , 2005, J. Sched..
[11] Sigrid Knust,et al. Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..
[12] Alan S. Manne,et al. On the Job-Shop Scheduling Problem , 1960 .
[13] Jen-Shiang Chen,et al. Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..