A NEW APPROACH TO AUTOMATICALLY PRODUCING SCHEDULES FOR CANE RAILWAYS
暂无分享,去创建一个
[1] Christian Artigues,et al. A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..
[2] Erhan Kozan,et al. Machine Scheduling techniques to optimise sugarcane rail transport systems , 2009 .
[3] Erhan Kozan,et al. A Constraint Programming Approach to Optimise Sugarcane Rail Operations , 2010 .
[4] P. G. Everitt,et al. Towards an integrated cane transport scheduling system , 1997 .
[5] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[6] D. J. Abel,et al. A Routing and Scheduling Problem for a Rail System: A Case Study , 1981 .
[7] Xinghuo Yu,et al. Cane Railway Scheduling via Constraint Logic Programming: Labelling Order and Constraints in a Real-Life Application , 2001, Ann. Oper. Res..
[8] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[9] Erhan Kozan,et al. A job-shop scheduling approach for optimising sugarcane rail operations , 2011 .