Permutation flowshop scheduling with simple linear deterioration

References

• Ahmadizar, F., and Z. Amiri. 2018. “Outsourcing and Scheduling for a Two-Machine Flow Shop with Release Times.” Engineering Optimization 50 (3): 483–498. doi: 10.1080/0305215X.2017.1325483
   Web of Science ®Google Scholar
• Bank, M., S. M. T. Fatemi, F. Jolai, and J. Behnamiah. 2012. “Two-Machine Flow Shop Total Tardiness Scheduling Problem with Deteriorating Jobs.” Applied Mathematical Modelling 36 (11): 5418–5426. doi: 10.1016/j.apm.2011.12.010
   Web of Science ®Google Scholar
• Brucker, P. 2007. Scheduling Algorithms. 2nd ed. Heidelberg: Springer.
   Google Scholar
• Cheng, M., S. Sun, and L. He. 2007. “Flow Shop Scheduling Problems with Deteriorating Jobs on No-Idle Dominant Machines.” European Journal of Operational Research 183 (1): 115–124. doi:10.1016/j.ejor.2006.10.043
   Web of Science ®Google Scholar
• Cheng, M., P. R. Tadikamalla, J. Shang, and S. Zhang. 2014. “Bicriteria Hierarchical Optimization of Two-Machine Flow Shop Scheduling Problem with Time-Dependent Deteriorating Jobs.” European Journal of Operational Research 234 (3): 650–657. doi:10.1016/j.ejor.2013.09.033
   Web of Science ®Google Scholar
• Cheng, M., P. R. Tadikamalla, J. Shang, and B. Zhang. 2015. “Two-Machine Flow Shop Scheduling with Deteriorating Jobs: Minimizing the Weighted Sum of Makespan and Total Completion Time.” Journal of the Operational Research Society 66 (5): 709–719. doi:10.1057/jors.2014.58
   Web of Science ®Google Scholar
• Cheng, M., G. Wang, and L. He. 2009. “Parallel Machines Scheduling Problems with Proportionally Deteriorating Jobs.” International Journal of Systems Science 40 (1): 53–57. doi: 10.1080/00207720802095160
   Web of Science ®Google Scholar
• Davoudpour, H., and M. H. Molona. 2008. “Solving Flow Shop Sequencing Problem for Deteriorating Jobs by Using Electro Magnetic Algorithm.” Journal of Applied Sciences 8 (22): 4121–4128. doi: 10.3923/jas.2008.4121.4128
   Google Scholar
• Gawiejnowicz, S. 2008. Time-Dependent Scheduling. Berlin: Springer.
   Google Scholar
• Gonzalez, T., and S. Sahni. 1978. “Flowshop and Jobshop Schedules: Complexity and Approximation.” Operations Research 26 (1): 36–52. doi: 10.1287/opre.26.1.36
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326. doi: 10.1016/S0167-5060(08)70356-X
   Google Scholar
• Jafari, A.-A., H. Khademi-Zare, M. M. Lotfi, and R. Tavakkoli-Moghaddam. 2016. “A Note on ‘Minimizing Makespan in Three Machine Flow Shop with Deteriorating Jobs’.” Computers & Operations Research 72: 93–96. doi: 10.1016/j.cor.2016.02.001
   Web of Science ®Google Scholar
• Kao, G. K., E. C. Sewell, S. H. Jacobson, and S. N. Hall. 2012. “New Dominance Rules and Exploration Strategies for the 1∣ri∣∑Ui Scheduling Problem.” Computational Optimization and Applications 51 (3): 1253–1274. doi: 10.1007/s10589-010-9378-7
   Google Scholar
• Kononov, A. 1996. “Combinatorial Complexity of Scheduling Jobs with Simple Linear Deterioration.” Discrete Analysis and Operations Research 3 (2): 15–32 [In Russian].
   Google Scholar
• Kononov, A. 1998. “A Single Machine Scheduling Problems with Processing Times Proportional to an Arbitrary Function.” Discrete Analysis and Operations Research 5 (1): 17–37 [In Russian].
   Google Scholar
• Kononov, A., and S. Gawiejnowicz. 2001. “NP-Hard Cases in Scheduling Deteriorating Jobs on Dedicated Machines.” Journal of the Operational Research Society 52 (6): 708–717. doi: 10.1057/palgrave.jors.2601117
   Web of Science ®Google Scholar
• Kunnathur, A. S., and S. K. Gupta. 1990. “Minimizing the Makespan with Late Start Penalties Added to Processing Times in a Single Facility Scheduling Problem.” European Journal of Operational Research 47 (1): 56–64. doi: 10.1016/0377-2217(90)90089-T
   Web of Science ®Google Scholar
• Lee, W.-C., Y.-R. Shiau, S.-K. Chen, and C.-C. Wu. 2010. “A Two-Machine Flowshop Scheduling Problem with Deteriorating Jobs and Blocking.” International Journal of Production Economics 124 (1): 188–197. doi: 10.1016/j.ijpe.2009.11.001
   Web of Science ®Google Scholar
• Lee, W.-C., C.-C. Wu, Y.-H. Chung, and H.-C. Liu. 2009. “Minimizing the Total Completion Time in Permutation Flow Shop with Machine-Dependent Job Deterioration Rates.” Computers and Industrial Engineering 36: 2111–2121.
   Google Scholar
• Lee, W.-C., C.-C. Wu, C.-C. Wen, and Y.-H. Chung. 2008. “A Two-Machine Flowshop Makespan Scheduling Problem with Deteriorating Jobs.” Computers and Industrial Engineering 54: 737–749. doi: 10.1016/j.cie.2007.10.010
   Web of Science ®Google Scholar
• Lee, W.-C., W.-C. Yeh, and Y.-H. Chung. 2014. “Total Tardiness Minimization in Permutation Flowshop with Deterioration Consideration.” Applied Mathematical Modelling 38 (13): 3081–3092. doi: 10.1016/j.apm.2013.11.031
   Web of Science ®Google Scholar
• Mosheiov, G. 1994. “Scheduling Jobs under Simple Linear Deterioration.” Computers and Operations Research 21 (6): 653–659. doi: 10.1016/0305-0548(94)90080-9
   Web of Science ®Google Scholar
• Mosheiov, G. 2002. “Complexity Analysis of Job-Shop Scheduling with Deteriorating Jobs.” Discrete Applied Mathematics 117 (1-3): 195–209. doi: 10.1016/S0166-218X(00)00385-1
   Web of Science ®Google Scholar
• Mosheiov, G., A. Sarig, and J. Sidney. 2010. “The Browne–Yechiali Single-Machine Sequence is Optimal for Flowshops.” Computers and Operations Research 37 (11): 1965–1967. doi: 10.1016/j.cor.2010.01.006
   Web of Science ®Google Scholar
• Nagano, M. S., F. L. Rossi, and N. J. Martarelli. 2018. “High-Performing Heuristics to Minimize Flowtime in No-Idle Permutation Flowshop.” Engineering Optimization. doi:10.1080/0305215X.2018.1444163.
   Web of Science ®Google Scholar
• Ng, C.-T., T. C. E. Cheng, A. Bachman, and A. Janiak. 2002. “Three Scheduling Problems with Deteriorating Jobs to Minimize the Total Completion Time.” Information Processing Letters 81 (6): 327–333. doi: 10.1016/S0020-0190(01)00244-7
   Web of Science ®Google Scholar
• Ng, C. T., J.-B. Wang, T. C. E. Cheng, and S. S. Lam. 2011. “Flowshop Scheduling of Deteriorating Jobs on Dominating Machines.” Computers and Industrial Engineering 61: 647–654. doi: 10.1016/j.cie.2011.04.020
   Web of Science ®Google Scholar
• Ng, C. T., J.-B. Wang, T. C. E. Cheng, and L. L. Liu. 2010. “A Branch-and-Bound Algorithm for Solving a Two-Machine Flow Shop Problem with Deteriorating Jobs.” Computers and Operations Research 37 (1): 83–90. doi: 10.1016/j.cor.2009.03.019
   Web of Science ®Google Scholar
• Pan, Q.-K., and R. Ruiz. 2013. “A Comprehensive Review and Evaluation of Permutation Flowshop Heuristics to Minimize Flowtime.” Computers and Operations Research 40 (1): 117–128. doi: 10.1016/j.cor.2012.05.018
   Web of Science ®Google Scholar
• Pinedo, M. L. 2005. Planning and Scheduling in Manufacturing and Services. Heidelberg: Springer.
   Google Scholar
• Ren, T., P. Zhao, D. Zhang, B. Liu, H. Yuan, and D. Bai. 2017. “Permutation Flow-Shop Scheduling Problem to Optimize a Quadratic Objective Function.” Engineering Optimization 49 (9): 1589–1603. doi: 10.1080/0305215X.2016.1261127
   Web of Science ®Google Scholar
• Sun, L.-H., L.-Y. Sun, K. Cui, and J.-B. Wang. 2010. “A Note on Flow Shop Scheduling Problems with Deteriorating Jobs on No-Idle Dominant Machines.” European Journal of Operational Research 200 (1): 309–311. doi: 10.1016/j.ejor.2008.12.029
   Web of Science ®Google Scholar
• Sun, L.-H., L.-Y. Sun, M.-Z. Wang, and J.-B. Wang. 2012. “Flow Shop Makespan Minimization Scheduling with Deteriorating Jobs under Dominating Machines.” International Journal of Production Economics 138 (1): 195–200. doi: 10.1016/j.ijpe.2012.03.023
   Web of Science ®Google Scholar
• Wang, J.-B. 2010. “Flow Shop Scheduling with Deteriorating Jobs under Dominating Machines to Minimize Makespan.” International Journal of Advanced Manufacturing Technology 48 (5): 719–723. doi: 10.1007/s00170-009-2314-2
   Web of Science ®Google Scholar
• Wang, X., X. Hu, and W. Liu. 2015. “Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times.” Asia–Pacific Journal of Operational Research 32 (6): Article ID 1550049. doi:10.1142/S0217595915500499.
   Web of Science ®Google Scholar
• Wang, J.-B., and X.-X. Liang. 2018. “Group Scheduling with Deteriorating Jobs and Allotted Resource under Limited Resource Availability Constraint.” Engineering Optimization. doi:10.1080/0305215X.2018.1454442
   Web of Science ®Google Scholar
• Wang, J.-B., C. T. Ng, T. C. E. Cheng, and L. L. Liu. 2006. “Minimizing Total Completion Time in a Two-Machine Flow Shop with Deteriorating Jobs.” Applied Mathematics and Computation 180 (1): 185–193. doi: 10.1016/j.amc.2005.11.162
   Web of Science ®Google Scholar
• Wang, J.-B., and M.-Z. Wang. 2013. “Minimizing Makespan in Three-Machine Flow Shops with Deteriorating Jobs.” Computers & Operations Research 40 (2): 547–557. doi: 10.1016/j.cor.2012.08.006
   Web of Science ®Google Scholar
• Wang, J.-B., and J.-J. Wang. 2014. “Flowshop Scheduling with a General Exponential Learning Effect.” Computers and Operations Research 43: 292–308. doi: 10.1016/j.cor.2013.09.001
   Web of Science ®Google Scholar
• Wang, J.-B., and Z.-Q. Xia. 2006a. “Flow Shop Scheduling with Deteriorating Jobs under Dominating Machines.” Omega 34 (4): 327–336. doi:10.1016/j.omega.2004.10.006
   Web of Science ®Google Scholar
• Wang, J.-B., and Z.-Q. Xia. 2006b. “Flow Shop Scheduling Problems with Deteriorating Jobs under Dominating Machines.” Journal of the Operational Research Society 57 (2): 220–226. doi:10.1057/palgrave.jors.2601959
   Web of Science ®Google Scholar
• Wang, X.-Y., Z. Zhou, J.-B. Wang, and P. Ji. 2014. “Parallel Machines Scheduling with Simple Linear Job Deterioration and Non-Simultaneous Machine Available Times.” Computers & Industrial Engineering 74: 88–91. doi:10.1016/j.cie.2014.05.003
   Web of Science ®Google Scholar
• Wu, C.-C., and W.-C. Lee. 2006. “Two-Machine Flowshop Scheduling to Minimize Mean Flow Time under Linear Deterioration.” International Journal of Production Economics 103: 572–584. doi: 10.1016/j.ijpe.2005.11.005
   Web of Science ®Google Scholar
• Zhao, C., and H. Tang. 2012. “Two-Machine Flow Shop Scheduling with Deteriorating Jobs and Chain Precedence Constraints.” International Journal of Production Economics 136 (1): 131–136. doi: 10.1016/j.ijpe.2011.09.023
   Web of Science ®Google Scholar