533
Views
10
CrossRef citations to date
0
Altmetric
Articles

A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance

, &
Pages 4086-4102 | Received 21 Nov 2018, Accepted 05 Jul 2019, Published online: 17 Jul 2019

References

  • Chakhlevitch, Konstantin, Celia A. Glass, and Hans Kellerer. 2011. “Batch Machine Production with Perishability Time Windows and Limited Batch Size.” European Journal of Operational Research 210: 39–47. doi:10.1016/j.ejor.2010.10.033.
  • Cheng, Bayi, Junfeng Cai, Shanlin Yang, and Xiaoxuan Hu. 2014. “Algorithms for Scheduling Incompatible Job Families on Single Batching Machine with Limited Capacity.” Computers & Industrial Engineering 75: 116–120. doi:10.1016/j.cie.2014.06.014.
  • Cheng, T. C. E., Wen-Chiung Lee, and Chin-Chia Wu. 2010. “Single-machine Scheduling with Deteriorating Functions for job Processing Times.” Applied Mathematical Modelling 34: 4171–4178. doi: 10.1016/j.apm.2010.04.014
  • Cheng, Mingbao, Shuxian Xiao, Renfei Luo, and Zhaotong Lian. 2018. “Single-machine Scheduling Problems with a Batch-Dependent Aging Effect and Variable Maintenance Activities.” International Journal of Production Research 56 (23): 7051–7063. doi: 10.1080/00207543.2017.1398424
  • Chiang, Tsung-Che, Hsueh-Chien Cheng, and Li-Chen Fu. 2010. “A Memetic Algorithm for Minimizing Total Weighted Tardiness on Parallel Batch Machines with Incompatible Job Families and Dynamic Job Arrival.” Computers & Operations Research 37: 2257–2269. doi:10.1016/j.cor.2010.03.017.
  • Chou, Fuh-Der, Pei-Chann Chang, and Hui-Mei Wang. 2006. “A Hybrid Genetic Algorithm to Minimize Makespan for the Single Batch Machine Dynamic Scheduling Problem.” The International Journal of Advanced Manufacturing Technology 31 (3–4): 350–359. doi:10.1007/s00170-005-0194-7.
  • Chung, Tsui-Ping, Zhen Xue, Tong Wu, and Stephen C. Shih. 2019. “Minimising Total Completion Time on Single-Machine Scheduling with New Integrated Maintenance Activities.” International Journal of Production Research 57 (3): 918–930. doi:10.1080/00207543.2018.1496294.
  • Cui, Wei-Wei, and Zhiqiang Lu. 2017. “Minimizing the Makespan on a Single Machine with Flexible Maintenances and Jobs’ Release Dates.” Computers and Operations Research 80: 11–22. doi:10.1016/j.cor.2016.11.008.
  • Dupont, L., and F. Jolai Ghazvini. 1998. “Minimizing Makespan on a Single Batch Processing Machine with Non-Identical Job Sizes: A Hybrid Genetic Approach.” European Journal of Automation System 32: 431–440.
  • Huang, Jingying, and Liya Wang. 2018. “Makespan Minimization on Single Batch-processing Machine Cnsidering Preventive Maintenance.” 5th International Conference on Industrial Engineering and Applications (ICIEA), Singapore.
  • Jia, Zhao-hong, and Joseph Y.-T. Leung. 2015. “A Meta-Heuristic to Minimize Makespan for Parallel Batch Machines with Arbitrary Job Sizes.” European Journal of Operational Research 240: 649–665. doi:10.1016/j.ejor.2014.07.039.
  • Jin, Yulan, Jiang Zuhua, and Hou Wenrui. 2008. “Multi-objective Integrated Optimization Research on Preventive Maintenance Planning and Production Scheduling for a Single Machine.” The International Journal of Advanced Manufacturing Technology 39: 954–964. doi: 10.1007/s00170-007-1268-5
  • Kubzin, M. A., and V. A. Strusevich. 2006. “Planning Machine Maintenance in Two-Machine Shop Scheduling.” Operations Research 54 (4): 789–800. doi:10.1287/opre.1060.0301.
  • Lee, C. Y., and V. J. Leon. 2001. “Machine Scheduling with a Rate-Modifying Activity.” European Journal of Operational Research 128: 119–128. doi:10.1016/S0377-2217(99)00066-1.
  • Lin, Te-Wei, and Chung-Ho Wang. 2012. “A Hybrid Genetic Algorithm to Minimize the Periodic Preventive Maintenance Cost in a Series-Parallel System.” Journal of Intelligent Manufacturing 23: 1225–1236. doi:10.1007/s10845-010-0406-3.
  • Low, Chinyao, Min Ji, Chou-Jung Hsu, and Chwen-Tzeng Su. 2010. “Minimizing the Makespan in a Single Machine Scheduling Problems with Flexible and Periodic Maintenance.” Applied Mathematical Modelling 34: 334–342. doi:10.1016/j.apm.2009.04.014.
  • Lu, Zhiqiang, Weiwei Cui, and Xiaole Han. 2015. “Integrated Production and Preventive Maintenance Scheduling for a Single Machine with Failure Uncertainty.” Computers & Industrial Engineering 80: 236–244. doi:10.1016/j.cie.2014.12.017.
  • Malve, Sujay, and Reha Uzsoy. 2007. “A Genetic Algorithm for Minimizing Maximum Lateness on Parallel Identical Batch Processing Machines with Dynamic Job Arrivals and Incompatible Job Families.” Computers & Operations Research 34: 3016–3028. doi:10.1016/j.cor.2005.11.011.
  • Mathirajan, M., A. I. Sivakumar, and V. Chandru. 2004. “Scheduling Algorithms for Heterogeneous Batch Processors with Incompatible Job Families.” Journal of Intelligent Manufacturing 15 (6): 787–803. doi:10.1023/b:jims.0000042664.94495.26.
  • Mohammed, Sbihi, and Christophe Varnier. 2008. “Single-machine Scheduling with Periodic and Flexible Periodic Maintenance to Minimize Maximum Tardiness.” Computers & Industrial Engineering 55 (4): 830–840. doi: 10.1016/j.cie.2008.03.005
  • Mosheiov, G., and J. B. Sidney. 2010. “Scheduling a Deteriorating Maintenance Activity on a Single Machine.” Journal of Operational Research Society 61: 882–887. doi:10.1057/jors.2009.5.
  • Paprocka, Iwona. 2018. “The Model of Maintenance Planning and Production Scheduling for Maximising Robustness.” International Journal of Production Research 05 July 2018: 1–22. doi:10.1080/00207543.2018.1492752.
  • Pham, H., and H. Wang. 1996. “Imperfect Maintenance.” European Journal of Operational Research 94: 425–438. doi:10.1016/S0377-2217(96)00099-9.
  • Rafiee Parsa, N., B. Karimi, and A. Husseinzadeh Kashan. 2010. “A Branch and Price Algorithm to Minimize Makespan on a Single Batch Processing Machine with Non-Identical Job Sizes.” Computers & Operations Research 37 (10): 1720–1730. doi:10.1016/j.cor.2009.12.007.
  • Rafiee Parsa, N., B. Karimi, and S. M. Moattar Husseini. 2016. “Minimizing Total Flow Time on a Batch Processing Machine Using a Hybrid Max–min Ant System.” Computers & Industrial Engineering 99: 372–381. doi:10.1016/j.cie.2016.06.008.
  • Stéphane, Dauzere Péresa, and Lars Mönch. 2013. “Scheduling Jobs on a Single Batch Processing Machine with Incompatible Job Families and Weighted Number of Tardy Jobs Objective.” Computers &Operations Research 40: 1224–1233. doi: 10.1016/j.cor.2012.12.012
  • Uzsoy, R. 1994. “Scheduling a Single Batch Processing Machine with Non-Identical Job Sizes.” International Journal of Production Research 32: 1615–1635. doi:10.1080/00207549408957026.
  • Uzsoy, R. 1995. “Scheduling Batch Processing Machines with Incompatible Job Families.” International Journal of Production Research 33 (10): 2685–2708. doi:10.1080/00207549508904839.
  • Van De Rzee, D.J, Van Harten .A, and Schuur .P.C. 2010. “Dynamic Job Assignment Heuristics for Multi-Server Batch Operations—A Cost Based Approach.” International Journal of Production Research 35 (11): 3063–3094. doi: 10.1080/002075497194291
  • Wang, Hongzhou. 2002. “A Survey of Maintenance Policies of Deteriorating Systems.” European Journal of Operational Research 139: 469–489. doi:10.1016/S0377-2217(01)00197-7.
  • Wang, Shijin. 2013. “Bi-objective Optimisation for Integrated Scheduling of Single Machine with Setup Times and Preventive Maintenance Planning.” International Journal of Production Research 51 (12): 3719–3733. doi:10.1080/00207543.2013.765070.
  • Wang, Ting, Roberto Baldacci, Andrew Lim, and Qian Hu. 2018. “A Branch-and-Price Algorithm for Scheduling of Deteriorating Jobs and Flexible Periodic Maintenance on a Single Machine.” European Journal of Operational Research 271: 826–838. doi:10.1016/j.ejor.2018.05.050.
  • Wang, Shijin, and Ming Liu. 2012. “A Branch and Bound Algorithm for Single-Machine Production Scheduling Integrated with Preventive Maintenance Planning.” International Journal of Production Research 3 (51): 847–868. doi:10.1080/00207543.2012.676683.
  • Wang, Lin, Zhiqiang Lu, and Xiaole Han. 2019. “Joint Optimisation of Production, Maintenance and Quality for Batch Production System Subject to Varying Operational Conditions.” International Journal of Production Research 22 February 2019: 1–15. doi:10.1080/00207543.2019.1581956.
  • Xu, Rui, Huaping Chen, and Xueping Li. 2013. “A Bi-Objective Scheduling Problem on Batch Machines via a Pareto-Based Ant Colony System.” International Journal of Production Economics 145 (1): 371–386. doi:10.1016/j.ijpe.2013.04.053.
  • Yao, Xiaodong, E. Fernandez-Gaucherand, M. C. Fu, and S. I. Marcus. 2004. “Optimal Preventive Maintenance Scheduling in Semiconductor Manufacturing.” IEEE Transactions on Semiconductor Manufacturing 17: 345–356. doi:10.1109/tsm.2004.831948.
  • Yao, Shiqing, Zhibin Jiang, and Na Li. 2012. “A Branch and Bound Algorithm for Minimizing Total Completion Time on a Single Batch Machine with Incompatible Job Families and Dynamic Arrivals.” Computers &Operations Research 39: 939–951. doi:10.1016/j.cor.2011.06.003.
  • Yaser, Zarook, Javad Rezaeian, Reza Tavakkoli Moghaddam, Iraj Mahdavi, and Nikbakhsh Javadian. 2015. “Minimization of Makespan for the Single Batch-Processing Machine Scheduling Problem with Considering Aging Effect and Multi-Maintenance Activities.” The International Journal of Advanced Manufacturing Technology 76: 1879–1892. doi: 10.1007/s00170-014-6342-1
  • Zhou, Shengchao, Huaping Chen, Rui Xu, and Xueping Li. 2014. “Minimising Makespan on a Single Batch Processing Machine with Dynamic Job Arrivals and Non-Identical Job Sizes.” International Journal of Production Research 52 (8): 2258–2274. doi:10.1080/00207543.2013.854937.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.