مدل سازی مساله زمانبندی تولید جریان کارگاهی چند حالته با منابع محدود

Afshar-Nadjafi, B. (2014) A solution procedure for preemptive multi-mode project scheduling problem with mode changeability to resumption, Applied Computing and Informatics, DOI: 10.1016/j.aci.2014.02.003.
Cheng, J., J. Fowler, K. Kempf, S. Mason, (2014) Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting, Computers and Operations Research, DOI: 10.1016/j.cor.2014.04.018.
Cheng, J., Fowler, J., Kempf, K., (2012) Simulation-based multi-mode resource-constrained project scheduling of semiconductor equipment installation and qualification, Proceedings of the Winter Simulation Conference, 1-12.
Garcia, C., (2016) Resource-constrained scheduling with hard due windows and rejection penalties, Engineering optimization, 48(9), 1515-1528.
Kyriakidis, T.S., G.M. Kopanos, M.C. Georgiadis, (2012) MILP formulations for single- and multi-mode resource-constrained project scheduling problems, Computers and Chemical Engineering, 36, 369–385.
Lee C.H., Liao, C.J., Chung, T.P., (2014) Scheduling with multi-attribute setup times on two identical parallel machines, International Journal of Production Economics, 153, 130-138.
Lin, D., Lee, C.K.M., Ho, W. (2013) Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop, Engineering Applications of Artificial Intelligence, 26(4), 1282–1290.
مدل سازی مساله زمانبندی تولید جریان کارگاهی چند حالته با منابع محدود 361
Naderi, B., N. Salmasi, (2012) Permutation flowshops in group scheduling with sequence-dependent setup times, European Journal of Industrial Engineering, 6(2), 177-199.
Pinedo, M.L. (2008) Theory, algorithms, and systems, 3rd edn. Springer Science+Business Media, New York.
Stafford, E.F., F.T. Tseng, J.N.D. Gupta, (2005) Comparative evaluation of MILP flowshop models, Journal of Operational Research Society, 56, 88–101.
Tseng, F.T., E.F. Stafford, (2008) New MILP models for the permutation flowshop problem, Journal of the Operational Research Society, 59, 1373–1386.
Voß, S., Witt, A., (2007) Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application, International Journal of Production Economics, 105(2), 445–458.
Wang, L., C. Fang, (2011) An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem, Information Sciences, 181(20), 4804-4822.
Yazdani, M., M. Amiri, M. Zandieh, (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm, Expert Systems with Applications, 37(1), 678-687.
Zandieh, M., S.M.T. Fatemi Ghomi, S.M. Moattar Husseini, (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Applied Mathematics and Computation, 180(1), 111-127