Non-permutation flow shop scheduling problem with preemption-dependent processing time

References

• Agnetis, A. , Billaut, J.-C. , Gawiejnowicz, S. , Pacciarelli, D. , & Soukhal, A. (2014). Multiagent scheduling . Berlin, Heidelberg: Springer. doi:10.1007/978-3-642-41880-8
   Google Scholar
• Ballestín, F. , Valls, V. , & Quintanilla, S. (2009). Scheduling projects with limited number of preemptions. Computers & Operations Research , 36 , 2913–2925. doi:10.1016/j.cor.2009.01.006
   Google Scholar
• Braun, O. , & Schmidt, G. (2012). Parallel processor scheduling with limited number of preemptions. SIAM Journal on Computing , 32 , 671–680. Retrieved from http://epubs.siam.org/doi/abs/10.1137/S0097539702410697
   Google Scholar
• Chen, B. , Potts, C. N. , & Woeginger, G. J. (1999). A review of machine scheduling: Complexity, algorithms and approximability. In P. M. Pardalos , D.-Z. Du , & R. L. Graham (Eds.), Handbook of combinatorial optimization (pp. 1493–1641). New York, NY: Springer.
   Google Scholar
• Cho, Y. , & Sahni, S. (1981). Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Operations Research , 29 , 511–522. doi:10.1287/opre.29.3.511
   Google Scholar
• Cui, W.-W. , Lu, Z. , Zhou, B. , Li, C. , & Han, X. (2016). A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints. International Journal of Computer Integrated Manufacturing , 29 , 944–961. doi:10.1080/0951192X.2015.1130247
   Google Scholar
• Dobrin, R. , & Fohler, G. (2004). Reducing the number of preemptions in fixed priority scheduling. In Proceedings 16th Euromicro Conference on Real-Time Systems, ECRTS 2004 (pp. 144–152). Washington, DC: IEEE. http://doi.org/10.1109/EMRTS.2004.1311016
   Google Scholar
• Jiang, Y. , Hu, J. , Weng, Z. , & Zhu, Y. (2014). Parallel machine covering with limited number of preemptions. Applied Mathematics-A Journal of Chinese Universities , 29 , 18–28. doi:10.1007/s11766-014-3138-x
   Google Scholar
• Jiang, Y. , Weng, Z. , & Hu, J. (2012). Algorithms with limited number of preemptions for scheduling on parallel machines. Journal of Combinatorial Optimization , 27 , 711–723. doi:10.1007/s10878-012-9545-0
   Google Scholar
• Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly , 1 , 61–68. doi:10.1002/nav.3800010110
   Google Scholar
• Klonowska, K. , Lundberg, L. , & Lennerstad, H. (2009). The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica , 46 , 285–295. doi:10.1007/s00236-009-0096-5
   Google Scholar
• Koulamas, C. (1998). A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research , 105 , 66–71. doi:10.1016/S0377-2217(97)00027-1
   Google Scholar
• Liao, C. J. , Liao, L. M. , & Tseng, C. T. (2006). A performance evaluation of permutation vs. non-permutation schedules in a flowshop. International Journal of Production Research , 44 , 4297–4309. doi:10.1080/00207540600595892
   Google Scholar
• Liaw, C.-F. (2016). A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption. Journal of Industrial and Production Engineering , 33 , 426–434. doi:10.1080/21681015.2016.1147088
   Google Scholar
• Lin, S.-W. , & Ying, K.-C. (2009). Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. International Journal of Production Research , 47 , 1411–1424. doi:10.1080/00207540701484939
   Google Scholar
• McCormick, S. T. , & Pinedo, M. L. (1995). Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: A parametric analysis. ORSA Journal on Computing , 7 , 63–77. doi:10.1287/ijoc.7.1.63
   Google Scholar
• Potts, C. N. , Shmoys, D. B. , & Williamson, D. P. (1991). Permutation vs. non-permutation flow shop schedules. Operations Research Letters , 10 , 281–284. doi:10.1016/0167-6377(91)90014-G
   Google Scholar
• Pugazhendhi, S. , Thiagarajan, S. , Rajendran, C. , & Anantharaman, N. (2003). Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems. Computers & Industrial Engineering , 44 , 133–157. doi:10.1016/S0360-8352(02)00189-4
   Google Scholar
• Ramezanian, R. (2014). MILP formulation and genetic algorithm for non-permutation flow shop scheduling problem with availability constraints. International Journal of Applied Operational Research , 4 , 11–26.
   Google Scholar
• Rossit, D. , Tohmé, F. , Frutos, M. , Bard, J. , & Broz, D. (2016). A non-permutation flowshop scheduling problem with lot streaming: A mathematical model. International Journal of Industrial Engineering Computations , 7 , 507–516. doi:10.5267/j.ijiec.2015.11.004
   Google Scholar
• Tandon, M. , Cummings, P. T. , & LeVan, M. D. (1991). Flowshop sequencing with non-permutation schedules. Computers & Chemical Engineering , 15 , 601–607. doi:10.1016/0098-1354(91)80014-M
   Google Scholar
• Thekkilakattil, A. , Pillai, A. , Dobrin, R. , & Punnekkat, S. (2010, November 4). Reducing the number of preemptions in real-time systems scheduling by CPU frequency scaling. 18th International Conference on Real-Time and Network Systems . Toulouse: HAL. Retrieved from https://hal.archives-ouvertes.fr/hal-00546923/
   Google Scholar
• Thevenin, S. , Zufferey, N. , & Potvin, J.-Y. (2016). Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility. International Journal of Production Research , 1–19. doi:10.1080/00207543.2016.1181285
   Google Scholar
• Vahedi-Nouri, B. , Fattahi, P. , & Ramezanian, R. (2013). Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems , 32 , 167–173. doi:10.1016/j.jmsy.2012.08.001
   Google Scholar
• Xiao, Y. , Yuan, Y. , Zhang, R.-Q. , & Konak, A. (2015). Non-permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation , 270 , 312–333. doi:10.1016/j.amc.2015.08.011
   Google Scholar