[
Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D., 2014 A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. Journal of Scheduling, 17(1), 17-29.
]Search in Google Scholar
[
Arroyo, J.E.C., Leung, J.Y.T., 2017. Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Computers & Operations Research, 78, 117-128.
]Search in Google Scholar
[
Chai, X., Li, W., Ng, C.T., Cheng, T.C.E., 2023. Approximation algorithms for batch scheduling with processing set restrictions. Journal of Scheduling, 26, 523–533.
]Search in Google Scholar
[
Chen, R.B., Lu, L.F., Yuan, J.J., Zhang, L.Q., 2020. Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery. Journal of the Operations Research Society of China, 8(1), 133-143.
]Search in Google Scholar
[
Cheng, B., Yang, S., Hu, X., Chen, B., 2012. Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Applied Mathematical Modelling, 36(7), 3161-3167.
]Search in Google Scholar
[
Chung, S.H., Tai, Y.T., Pearn, W.L., 2009. Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes. International Journal of Production Research, 47(18), 5109-5128.
]Search in Google Scholar
[
Damodaran, P., Velez-Gallego, M.C., 2010. Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times. International Journal of Advanced Manufacturing Technology, 49, 1119-1128.
]Search in Google Scholar
[
Geng, Z., Yuan. J., Yuan, J., 2018. Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Applied Mathematics and Computation, 332, 1-18.
]Search in Google Scholar
[
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
]Search in Google Scholar
[
He, C., Xu, C.Q., Lin, H., 2020. Serial-batching scheduling with two agents to minimize makespan and maximum cost. Journal of Scheduling, 23(5), 609-617.
]Search in Google Scholar
[
He, C., Lin, H., 2021. Improved algorithms for two-agent scheduling on an unbounded serial-batching machine. Discrete Optimization, 41, 1572-5286.
]Search in Google Scholar
[
Huang, J.Y., Wang, L., Jiang, Z.B., 2020. A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance. International Journal of Production Research, 58(13), 4086-4102.
]Search in Google Scholar
[
Hulett, M., Damodaran, P., Amouie, M., 2017. Scheduling Non-identical Parallel Batch Processing Machines to Minimize Total Weighted Tardiness Using Particle Swarm Optimization. Computers & Industrial Engineering, 113(11), 425-436.
]Search in Google Scholar
[
Jiang, W., Shen, Y.L., Liu, L.X., Zhao, X.C., Shi, L., 2022. A new method for a class of parallel batch machine scheduling problem. Flexible Services and Manufacturing Journal, 34, 518–550.
]Search in Google Scholar
[
Lee, C.Y., Uzsoy, R., Martin-Vega, L.A., 1992. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4), 764-775.
]Search in Google Scholar
[
Li, S., 2017. Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan. European Journal of Operational Research, 260(1), 12-20.
]Search in Google Scholar
[
Li, S.S., Zhang, Y.Z., 2014. Serial batch scheduling on uniform parallel machines to minimize total completion time. Information Processing Letters, 114(12), 692-695.
]Search in Google Scholar
[
Li, X.L., Li, Y.P., Wang, Y., 2017. Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme. International Journal of Production Research, 55(1), 176-186.
]Search in Google Scholar
[
Li, Y.J. and Li, S.G., 2020. Scheduling jobs with sizes and delivery times on identical parallel batch machines. Theoretical Computer Science, Vol.841, pp.1-9.
]Search in Google Scholar
[
Muter, B., 2020. Exact algorithms to minimize makespan on single and parallel batch processing machines. European Journal of Operational Research. 285(2), 470-483.
]Search in Google Scholar
[
Mohammad, Y., Mozhgan, M., Amir, H.A., 2020. Semi-permutation-based genetic algorithm for order acceptance and scheduling in two-stage assembly problem. Neural Computing and Applications, 32(30), 2989-3003.
]Search in Google Scholar
[
Pei, J., Liu, X.B., Pardalos, P.M., Li, K., Fan, W.J., Migdalas, A., 2017. Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optimization Letters, 11(7), 1257-1271.
]Search in Google Scholar
[
Rim, Z., Imed, E.B., Abderrazek, J., 2019. A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem. Swarm Intelligence, 13(2), 145–168.
]Search in Google Scholar
[
Uzunoglu, A., Gahm, C., Tuma, A., 2023. A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem. Annals of Operations Research, 1-22.
]Search in Google Scholar
[
Shabtay, D., 2014. The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. European Journal of Operational Research, 233(1), 64-74.
]Search in Google Scholar
[
Shi, Z., Huang, Z., Shi, L., 2018. Customer order scheduling on batch processing machines with incompatible job families, International Journal of Production Research, 56(1-2), 795-808.
]Search in Google Scholar
[
Song, L.B., Liu, C., Shi, H.B., Zhu, J., 2022. An Improved Immune Genetic Algorithm for Solving the Flexible Job Shop Scheduling Problem with Batch Processing. Wireless Communications and Mobile Computing, pp.1-17.
]Search in Google Scholar
[
Sun, X.Y., Shen, W.M., Vogel-Heuser, B., 2023. A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem. Journal of Manufacturing Systems, 390-405.
]Search in Google Scholar
[
Wang, J.Q., Fan, G., Liu, Z. 2020. Mixed batch scheduling on identical machines. Journal of Scheduling, 23, 487–496.
]Search in Google Scholar
[
Willy, C.S., Byung, S.K., 2024. Particle swarm optimization for integrated scheduling problem with batch additive manufacturing and batch direct-shipping delivery. Computers and Operations Research, 161, 106430.
]Search in Google Scholar
[
Zhang, X., Li, X., Wang, J. 2017. Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Computing and Applications, 28(1), 313-326.
]Search in Google Scholar
[
Zheng, S.X., Xie, N.M., Wu, Q., 2021. Single batch machine scheduling with dual setup times for autoclave molding manufacturing. Computers & Operations Research, 133(9), 1-23.
]Search in Google Scholar
[
Zhou, H., Pang, J., Chen, P.K., Chou, F.D., 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(9), 67-81.
]Search in Google Scholar
[
Zhou, S., Chen, H., Li, X., 2017. Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times. Applied Soft Computing, 52, 630-641.
]Search in Google Scholar
[
Zhou, S.C., Jin, M.Z., Liu, C., Zheng, X., Chen, H.P., 2022. Scheduling a single batch processing machine with non-identical two-dimensional job sizes. Expert Systems with Applications, 201, 0957-4174
]Search in Google Scholar
Profilo Orcid