Abdeljaoued, M. A., Saadani, N. E. H., & Bahroun, Z. (2020). Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints. Operational Research, 20, 2109-2132.
Abedi, M., Seidgar, H., Fazlollahtabar, H., & Bijani, R. (2015). Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits. International Journal of Production Research, 53(6),1680-1711.
Akturk, M. S., & Ozdemir, D. (2001). A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research,135(2),394-412.
Alhadi, G., Kacem, I., Laroche, P., & Osman, I. M. (2020). Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Annals of Operations Research, 285(1-2),369-395.
Anghinolfi, D., Paolucci, M., & Ronco, R. (2021). A bi-objective heuristic approach for green identical parallel machine scheduling. European Journal of Operational Research, 289(2),416-434.
Bandyopadhyay, S., & Bhattacharya, R. (2013). Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Applied Mathematical Modelling, 37(10-11),6718-6729.
Berrichi, A., Amodeo, L., Yalaoui, F., Châtelet,E., & Mezghiche, M. (2009). Bi-objective optimization algorithms for joint production and maintenance scheduling: application to the parallel machine problem. Journal of Intelligent Manufacturing, 20(4),389-400.
Biskup, D., Herrmann, J., & Gupta, J. N.D. (2008). Scheduling identical parallel machines to minimize total tardiness. International Journal of Production Economics,115(1),134-142.
Chen, Y., Huang, P., Huang, C., Huang, S., & Chou, F. (2021). Makespan minimization for scheduling on two identical parallel machines with flexible maintenance and nonresumable jobs. Journal of Industrial and Production Engineering, 38(1),1-14.
Cheng, T. C. E., & Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3),271-292.
Cochran, J. K., Horng, S., & Fowler, J.W. (2003). A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers & Operations Research, 30(7),1087-1102.
Cui, W., & Lu, Z. (2017). Minimizing the makespan on a single machine with flexible maintenances and jobs’ release dates. Computers & Operations Research,80,11-22.
Dipak, L., & Gupta., J.N.D. (2018). An Improved Cuckoo Search Algorithm for Scheduling Jobs on Identical Parallel Machines. Computers & Industrial Engineering,126, 348-360.
Fang, K. T., & Lin, B. (2013). Parallel-machine scheduling to minimize tardiness penalty and power cost. Computers & Industrial Engineering, 64(1),224-234.
Gupta, J.N.D., & A.J. Ruiz-Torres. (2001). A LISTFIT heuristic for minimizing makespan on identical parallel machines. Production Planning & Control,12(1), 28-36.
Hashemian, N., Diallo, C., & Vizvari, B. (2014). Makespan minimization for parallel machines scheduling with multiple availability constraints. Annals of Operations Research, 213,173-186.
Kayvanfar, V., Zandieh, M., & Teymourian, E. (2017). An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach. Computational and Applied Mathematics, 36,159-184.
Kim, J. G., Song, S., & Jeong, B. (2020). Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times. International Journal of Production Research, 58(6), 1628-1643. DOI:10.1080/00207543.2019.1672900.
Kramer, A., Dell’Amico, M., Feillet, D., & Iori, M. (2020). Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. Computers & Operations Research, 123, 105018.
Lee, C. H. (2018). A dispatching rule and a random iterated greedy metaheuristic for identical parallel machine scheduling to minimize total tardiness. International Journal of Production Research, 56(6), 2292-2308.
Lee, C.Y., & Chen, Z.L. (2000). Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics, 47,145-165.
Li, G., Liu, M., Sethi, S.P., & Xu, D. (2017). Parallel-machine scheduling with machine-dependent maintenance periodic recycles. International Journal of Production Economics,186, 1-7.
Li, K., Xiao, W., & Yang, S. (2019). Minimizing total tardiness on two uniform parallel machines considering a cost constraint. Expert Systems With Applications,123,143-153.
Liu, X., Chu, F., Zheng, F., Chu, C., & Liu, M. (2020). Parallel machine scheduling with stochastic release times and processing times. International Journal of Production Research,59(20),6327-6346.
Moradi, E., & Zandieh, M. (2010). Minimizing the makespan and the system unavailability in parallel machine scheduling problem: a similarity-based genetic algorithm. International Journal of Advanced Manufacturing Technology, 51(5-8),829-840.
Naderi, B., & Roshanaei, V. (2020). Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. European Journal of Operational Research, 286,811-827.
Nessah, R., Yalaoui, F., & Chu, C. (2008). A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release date. Computers & Operations Research, 35(4),1176-1190.
Schaller, J., & Valente, J. M. S. (2018). Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Computers & Industrial Engineering, 119,146-156.
Tan, Z., Yong, C., & An, Z. (2011). Parallel machines scheduling with machine maintenance for minsum criteria. European Journal of Operational Research, 212(2),287-292.
Wang, J. B., & Wei, C.M. (2011). Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties. Applied Mathematics and Computation, 217(20),8093-8099.
Wang, S., & Cui, W. (2020). Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time. International Journal of Production Research, 59(15),4579-4592.
Wang, S., & Liu, M. (2015). Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning. Journal of Manufacturing Systems,37,182-192.
Wang, S., Wang, X., Yu, J., Ma, S., & Liu, M. (2018). Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan. Journal of Cleaner Production,193,424-440.
Wu, L., & Wang, S. (2018). Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. International Journal of Production Economics, 201,26-40.
Wu, C., Yao, Y., Dauzère-Pérès, S., & Yu, C. (2020). Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration. Computers & Operations Research,113,104779.
Xu, D., Sun, K., & Li, H. (2008). Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers and Operations Research,35(4),1344-1349.
Xu, D., Cheng, Z., Yin, Y., & Li, H. (2009). Makespan minimization for two parallel machines scheduling with a periodic availability constraint. Computers & Operations Research,36(6),1809-1812.
Yalaoui, F., & Chu, C. (2006). New exact method to solve the Pm/r_j/∑▒C_j schedule problem. International Journal of Production Economics,100(1),168-179.
Yue, L., Guan, Z., Zhang, L., Ullah, S., & Cui, Y. (2019). Multi objective lotsizing and scheduling with material constraints in flexible parallel lines using a Pareto based guided artificial bee colony algorithm. Computers & Industrial Engineering, 128,659-680.
Yoo, J., & Lee, I.S. (2016). Parallel machine scheduling with maintenance activities. Computers & Industrial Engineering, 101,361-371.
Zhang, L., Deng, Q., Zhao, Y., Fan, Q., Liu, X., & Gong, G. (2021). Joint optimization of demand-side operational utility and manufacture-side energy consumption in a distributed parallel machine environment. Computers & Industrial Engineering, 164 (2022),107863.
Zhou, H., Pang, J., Chen, P., & Chou, F. (2018). A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes. Computers & Industrial Engineering, 123,67-81.