Scheduling of sequence-dependant jobs on parallel multiprocessor systems using a branch and bound-based Petri net
暂无分享,去创建一个
[1] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.
[2] Jonathan F. Bard,et al. A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times , 1999 .
[3] Sohrab Khanmohammadi,et al. Modeling of Flexible Manufacturing Systems by Timed Petri Net , 2004, International Conference on Computational Intelligence.
[4] Y. F. Zhang,et al. A Branch and Bound Algorithm Based Process-Planning System for Plastic Injection Mould Bases , 2001 .
[5] Satoshi Fujita,et al. A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..
[6] Kang G. Shin,et al. A parametrized branch-and-bound strategy for scheduling precedence-constrained tasks on a multiprocessor system , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).
[7] Sohrab Khanmohammadi,et al. Task scheduling in manufacturing systems based on an efficient branch and bound algorithm , 2004, IEEE Conference on Robotics, Automation and Mechatronics, 2004..
[8] Leyuan Shi,et al. A method for scheduling in parallel manufacturing systems with flexible resources , 2000 .
[9] Andrew Kusiak,et al. Scheduling manufacturing systems in an agile environment , 2001 .