Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue

References

• AitZai, A., Benmedjdoub, B., & Boudhar, M. (2016). Branch-and-bound and PSO algorithms for no-wait job shop scheduling. Journal of Intelligent Manufacturing, 27(3), 679–688.10.1007/s10845-014-0906-7
   Web of Science ®Google Scholar
• Bachman, A., & Janiak, A. (2000). Minimizing maximum lateness under linear deterioration. European Journal of Operational Research, 126(3), 557–566.10.1016/S0377-2217(99)00310-0
   Web of Science ®Google Scholar
• Barketau, M. S., Cheng, T. C. E., Ng, C. T., Kotov, V., & Kovalyov, M. Y. (2008). Batch scheduling of step deteriorating jobs. Journal of Scheduling, 11(1), 17–28.10.1007/s10951-007-0047-3
   Web of Science ®Google Scholar
• Bean, J. C. (1994). genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154–160.10.1287/ijoc.6.2.154
   Google Scholar
• Cheng, T. C. E., & Ding, Q. (2001). Single machine scheduling with step-deteriorating processing times. European Journal of Operational Research, 134(3), 623–630.10.1016/S0377-2217(00)00284-8
   Web of Science ®Google Scholar
• Cheng, W., Guo, P., Zhang, Z., Zeng, M., & Liang, J. (2012). Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs. Mathematical Problems in Engineering, 2012(7), 243–261. doi:10.1155/2012/928312
   Web of Science ®Google Scholar
• Chung, B. D., & Kim, B. S. (2016). A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities. Computers & Industrial Engineering, 98, 113–124.10.1016/j.cie.2016.05.028
   Web of Science ®Google Scholar
• Chung, T. P., & Sun, H. (2017). Scheduling batch processing machine problem with non-identical job sizes via artificial immune system. Journal of Industrial and Production Engineering. doi:10.1080/21681015.2017.1407830
   Web of Science ®Google Scholar
• Costa, A. (2015). Hybrid genetic optimization for solving the batch-scheduling problem in a pharmaceutical industry. Computers & Industrial Engineering, 79, 130–147.10.1016/j.cie.2014.11.001
   Web of Science ®Google Scholar
• Dai, H., Cheng, W., & Guo, P. (2018). An improved Tabu search for multi-skill resource-constrained project scheduling problems under step-deterioration. Arabian Journal for Science and Engineering. doi:10.1007/s13369-017-3047-4
   Web of Science ®Google Scholar
• Fan, W., Pei, J., Liu, X., Pardalos, P. M., & Kong, M. (2017). Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. Journal of Global Optimization, 71(1), 147–163. doi:10.1007/s10898-017-0536-7
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(1), 287–326.10.1016/S0167-5060(08)70356-X
   Google Scholar
• Guo, P., Cheng, W., & Wang, Y. (2015). Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm. Engineering Optimization, 47(11), 1564–1585.10.1080/0305215X.2014.982634
   Web of Science ®Google Scholar
• Guo, P., Cheng, W., & Wang, Y. (2017). Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine. International Journal of Systems Science: Operations & Logistics, 4(2), 92–107.
   Google Scholar
• Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449–467.10.1016/S0377-2217(00)00100-4
   Web of Science ®Google Scholar
• Jeng, A. A. K., & Lin, B. M. T. (2004). Makespan minimization in single-machine scheduling with step-deterioration of processing times. Journal of the Operational Research Society, 55(3), 247–256.10.1057/palgrave.jors.2601693
   Web of Science ®Google Scholar
• Ji, M., He, Y., & Cheng, T. C. E. (2007). Batch delivery scheduling with batch delivery cost on a single machine. European Journal of Operational Research, 176(2), 745–755.10.1016/j.ejor.2005.09.006
   Web of Science ®Google Scholar
• Kashan, A. H., & Karimi, B. (2009). A discrete particle swarm optimization algorithm for scheduling parallel machines. Computers & Industrial Engineering, 56(1), 216–223.10.1016/j.cie.2008.05.007
   Web of Science ®Google Scholar
• Kumar, A., & Tan, Y. (2015). The demand effects of joint product advertising in online videos. Management Science, 61(8), 1921–1937.10.1287/mnsc.2014.2086
   Web of Science ®Google Scholar
• Kunnathur, A. S., & Gupta, S. K. (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.10.1016/0377-2217(90)90089-T
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., & Voß, S. (2016). Modeling the parallel machine scheduling problem with step deteriorating jobs. European Journal of Operational Research, 255(1), 21–33.10.1016/j.ejor.2016.04.010
   Web of Science ®Google Scholar
• Layegh, J., Jolai, F., & Amalnik, M. S. (2009). A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration. Advances in Engineering Software, 40(10), 1074–1077.10.1016/j.advengsoft.2009.03.018
   Web of Science ®Google Scholar
• Lei, D., & Guo, X. (2016). Variable neighborhood search for the second type of two-sided assembly line balancing problem. Computers & Operations Research, 72, 183–188.10.1016/j.cor.2016.03.003
   Web of Science ®Google Scholar
• Leung, Y. T., Ng, C. T., & Cheng, T. C. E. (2008). Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times. European Journal of Operational Research, 187(3), 1090–1099.10.1016/j.ejor.2006.03.067
   Web of Science ®Google Scholar
• Li, S., Ng, C. T., Cheng, T., & Yuan, J. (2011). Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research, 210(3), 482–488.
   Web of Science ®Google Scholar
• Liang, Z., Feng, Y., Zhang, X., Wu, T., & Chaovalitwongse, W. A. (2015). Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem. Transportation Research Part B: Methodological, 78, 238–259.10.1016/j.trb.2015.03.013
   Web of Science ®Google Scholar
• Lin, S. W., & Ying, K. C. (2015). Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness. Applied Soft Computing, 30, 462–474.10.1016/j.asoc.2015.01.069
   Web of Science ®Google Scholar
• Liu, X., Lu, S., Pei, J., & Pardalos, P. M. (2017). A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs. International Journal of Production Research. doi:10.1080/00207543.2017.1418986
   Web of Science ®Google Scholar
• Lu, S., Liu, X., Pei, J., Thai, M. T., & Pardalos, P. M. (2018). A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Applied Soft Computing. doi:10.1016/j.asoc.2018.02.018
   Web of Science ®Google Scholar
• Ma, C., Kong, M., Pei, J., & Pardalos, P. M. (2017). BRKGA-VNS for parallel-batching scheduling on a single machine with step-deteriorating jobs and release times. In International Workshop on Machine Learning, Optimization, and Big Data (pp. 414–425). Cham: Springer.
   Google Scholar
• Miao, C., Zhang, Y., & Cao, Z. (2011). Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. Information Processing Letters, 111(16), 798–803.10.1016/j.ipl.2011.05.018
   Web of Science ®Google Scholar
• Mokhtari, H., & Noroozi, A. (2015). An efficient chaotic based pso for earliness/tardiness optimization in a batch processing flow shop scheduling problem. Journal of Intelligent Manufacturing, 29(5), 1063–1081. doi:10.1007/s10845-015-1158-x
   Web of Science ®Google Scholar
• Mor, B., & Mosheiov, G. (2012). Batch scheduling with step-deteriorating processing times to minimize flowtime. Naval Research Logistics, 59(8), 587–600.10.1002/nav.v59.8
   Web of Science ®Google Scholar
• Pacheco, J., Porras, S., Casado, S., & Baruque, B. (2018). Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. Knowledge-Based Systems, 145, 236–249.10.1016/j.knosys.2018.01.018
   Web of Science ®Google Scholar
• Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research. doi:10.1007/s10479-017-2481-8
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Liao, B., Pardalos, P. M., & Kong, M. (2017). Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production. Applied Mathematical Modelling. doi:10.1016/j.apm.2017.07.028
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2015). Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optimization Letters, 9(1), 91–104.10.1007/s11590-014-0740-z
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Pardalos, P. M., Fan, W., & Yang, S. (2017). Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Annals of Operations Research, 249(1–2), 175–195.10.1007/s10479-015-1824-6
   Web of Science ®Google Scholar
• Pei, J., Liu, X., Pardalos, P. M., Migdalas, A., & Yang, S. (2017). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization, 67(1–2), 251–262.10.1007/s10898-015-0320-5
   Web of Science ®Google Scholar
• Pei, J., Pardalos, P. M., Liu, X., Fan, W., & Yang, S. (2015). Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. European Journal of Operational Research, 244(1), 13–25.10.1016/j.ejor.2014.11.034
   Web of Science ®Google Scholar
• Qi, X., Zhou, S., & Yuan, J. (2009). Single machine parallel-batch scheduling with deteriorating jobs. Theoretical Computer Science, 410(8–10), 830–836.10.1016/j.tcs.2008.11.009
   Web of Science ®Google Scholar
• Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033–2049.10.1016/j.ejor.2005.12.009
   Web of Science ®Google Scholar
• Sundararaghavan, P. S., & Kunnathur, A. S. (1994). Single machine scheduling with start time dependent processing times: Some solvable cases. European Journal of Operational Research, 78(3), 394–403.10.1016/0377-2217(94)90048-5
   Web of Science ®Google Scholar
• Tan, Y., & Carrillo, J. E. (2017). Strategic analysis of the agency model for digital goods. Production and Operations Management, 26(4), 724–741.10.1111/poms.2017.26.issue-4
   Web of Science ®Google Scholar
• Tan, Y., Carrillo, J. E., & Cheng, H. K. (2016). The agency model for digital goods. Decision Sciences, 47(4), 628–660.10.1111/deci.2016.47.issue-4
   Web of Science ®Google Scholar
• Tang, L., Zhao, X., Liu, J., & Leung, Y. T. (2017). Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research, 263(2), 401–411. doi:10.1016/j.ejor.2017.05.019
   Web of Science ®Google Scholar
• Vallada, E., & Ruiz, R. (2011). A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. European Journal of Operational Research, 211(3), 612–622.10.1016/j.ejor.2011.01.011
   Web of Science ®Google Scholar
• Wang, H., & Chou, F. (2010). Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Systems with Applications, 37(2), 1510–1521.10.1016/j.eswa.2009.06.070
   Web of Science ®Google Scholar
• Wang, L., Yang, R., Xu, Y., Niu, Q., Pardalos, P. M., & Fei, M. (2013). An improved adaptive binary Harmony Search algorithm. Information Sciences, 232, 58–87.10.1016/j.ins.2012.12.043
   Web of Science ®Google Scholar
• Ying, K., Lin, S., Cheng, C., & He, C. (2017). Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Computers & Industrial Engineering, 110, 413–423.10.1016/j.cie.2017.06.025
   Web of Science ®Google Scholar
• Zhang, B., Pan, Q. K., Gao, L., & Zhang, X. L. (2018). A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Computers & Industrial Engineering, 116, 22–36.10.1016/j.cie.2017.12.013
   Web of Science ®Google Scholar
• Zhao, F., Liu, Y., Zhang, Y., Ma, W., & Zhang, C. (2017). A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems. Engineering Applications of Artificial Intelligence, 65, 178–199.10.1016/j.engappai.2017.07.023
   Web of Science ®Google Scholar
• Zobolas, G. I., Tarantilis, C. D., & Ioannou, G. (2009). A hybrid evolutionary algorithm for the job shop scheduling problem. Journal of the Operational Research Society, 60(2), 221–235.10.1057/palgrave.jors.2602534
   Web of Science ®Google Scholar