Online hierarchical parallel-machine scheduling in shared manufacturing to minimize the total completion time

References

• Almeida, F. S., & Nagano, M. S. (2022). Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, 1–12. https://doi.org/10.1080/01605682.2022.2039569
   Web of Science ®Google Scholar
• Bar-Noy, A., Freund, A., & Naor, J. (2001). On-line load balancing in a hierarchical server topology. SIAM Journal on Computing, 31(2), 527–549. https://doi.org/10.1137/S0097539798346135
   Web of Science ®Google Scholar
• Buchem, M., & Vredeveld, T. (2021). Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines. Computers & Operations Research, 125, 105093. https://doi.org/10.1016/j.cor.2020.105093
   Web of Science ®Google Scholar
• Cai, S., Liu, A., & Liu, K. (2017). Online scheduling of two identical machines under a grade of service provision. 36th Chinese Control Conference (CCC) (pp. 2718–2722). IEEE.
   Google Scholar
• Cai, S., & Liu, K. (2019). Heuristics for online scheduling on identical parallel machines with two GoS levels. Journal of Systems Science and Complexity, 32(4), 1180–1193. https://doi.org/10.1007/s11424-019-7427-6
   Web of Science ®Google Scholar
• Chassid, O., & Epstein, L. (2008). The hierarchical model for load balancing on two machines. Journal of Combinatorial Optimization, 15(4), 305–314. https://doi.org/10.1007/s10878-007-9078-0
   Web of Science ®Google Scholar
• Dai, B., Li, J., & Li, W. (2018). Semi-online hierarchical scheduling for bag-of-tasks on two machines. Proceedings of the 2nd International Conference on Computer Science and Artificial Intelligence (pp. 609–614). Association for Computing Machinery.
   Google Scholar
• Das, G., & Epstein, L. (2008). Preemptive scheduling on a small number of hierarchical machines. Information and Computation, 206(5), 602–619.
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
   Google Scholar
• Hong, J., Lee, K., & Pinedo, M. L. (2020). Scheduling equal length jobs with eligibility restrictions. Annals of Operations Research, 285(1–2), 295–314. https://doi.org/10.1007/s10479-019-03172-8
   Web of Science ®Google Scholar
• Hou, L., & Kang, L. (2012). Online scheduling on uniform machines with two hierarchies. Journal of Combinatorial Optimization, 24(4), 593–612. https://doi.org/10.1007/s10878-011-9410-6
   Web of Science ®Google Scholar
• Hu, J., Jiang, Y., Zhou, P., Zhang, A., & Zhang, Q. (2017). Total completion time minimization in online hierarchical scheduling of unit-size jobs. Journal of Combinatorial Optimization, 33(3), 866–881. https://doi.org/10.1007/s10878-016-0011-2
   Web of Science ®Google Scholar
• Hwang, H. C., Chang, S. Y., & Lee, K. (2004). Parallel machine scheduling under a grade of service provision. Computers & Operations Research, 31(12), 2055–2061. https://doi.org/10.1016/S0305-0548(03)00164-3
   Web of Science ®Google Scholar
• Ji, M., Ye, X., Qian, F., Cheng, T. C. E., & Jiang, Y. (2022). Parallel-machine scheduling in shared manufacturing. Journal of Industrial & Management Optimization, 18(1), 681–691. https://doi.org/10.3934/jimo.2020174
   Web of Science ®Google Scholar
• Jiang, Y. (2008). Online scheduling on parallel machines with two GoS levels. Journal of Combinatorial Optimization, 16(1), 28–38. https://doi.org/10.1007/s10878-007-9095-z
   Web of Science ®Google Scholar
• Jiang, Y., He, Y., & Tang, C. (2006). Optimal online algorithms for scheduling on two identical machines under a grade of service. Journal of Zhejiang University-SCIENCE A, 7(3), 309–314. https://doi.org/10.1631/jzus.2006.A0309
   Google Scholar
• Karhi, S., & Shabtay, D. (2013). On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines. Journal of Combinatorial Optimization, 26(1), 198–222. https://doi.org/10.1007/s10878-012-9460-4
   Web of Science ®Google Scholar
• Kim, H. J., Kim, E. S., & Lee, J. H. (2022). Scheduling of step-improving jobs with an identical improving rate. Journal of the Operational Research Society, 73(5), 1127–1136. https://doi.org/10.1080/01605682.2021.1886616
   Web of Science ®Google Scholar
• Li, P., & Jiang, P. (2021). Enhanced agents in shared factory: Enabling high-efficiency self-organization and sustainability of the shared manufacturing resources. Journal of Cleaner Production, 292, 126020. https://doi.org/10.1016/j.jclepro.2021.126020
   Web of Science ®Google Scholar
• Liu, Z., & Zhan, J. (2020). Online fractional hierarchical scheduling on uniformly related machines. Computers & Operations Research, 113, 104778. https://doi.org/10.1016/j.cor.2019.104778
   Web of Science ®Google Scholar
• Lu, X., & Liu, Z. (2015). Online hierarchical scheduling on two uniform machines with bounded job sizes. Asia-Pacific Journal of Operational Research, 32(05), 1550032. https://doi.org/10.1142/S0217595915500323
   Web of Science ®Google Scholar
• Lu, X., & Liu, Z. (2016). An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies. Journal of Systems Science and Complexity, 29(6), 1650–1657. https://doi.org/10.1007/s11424-016-5001-z
   Web of Science ®Google Scholar
• Luo, T., & Xu, Y. (2016). Optimal algorithm for semi-online scheduling on two machines under GoS levels. Optimization Letters, 10(1), 207–213. https://doi.org/10.1007/s11590-014-0838-3
   Web of Science ®Google Scholar
• Min, X., Liu, J., Dong, Y., & Jiang, M. (2015). Online preemptive hierarchical scheduling on two uniform machines with rejection. Asia-Pacific Journal of Operational Research, 32(04), 1550027. https://doi.org/10.1142/S021759591550027X
   Web of Science ®Google Scholar
• Park, J., Chang, S. Y., & Lee, K. (2006). Online and semi-online scheduling of two machines under a grade of service provision. Operations Research Letters, 34(6), 692–696. https://doi.org/10.1016/j.orl.2005.11.004
   Web of Science ®Google Scholar
• Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: A survey of milestones. Journal of the Operational Research Society, 60(sup1), S41–S68. https://doi.org/10.1057/jors.2009.2
   Web of Science ®Google Scholar
• Qi, X., & Yuan, J. (2019). Semi-online hierarchical scheduling on two machines for lp-norm load balancing. Asia-Pacific Journal of Operational Research, 36(01), 1950002. https://doi.org/10.1142/S0217595919500027
   Web of Science ®Google Scholar
• Shabtay, D., & Karhi, S. (2012). An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. Discrete Optimization, 9(4), 241–248. https://doi.org/10.1016/j.disopt.2012.07.005
   Web of Science ®Google Scholar
• Sun, X., Geng, X. N., & Liu, F. (2021). Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. Journal of the Operational Research Society, 72(12), 2674–2689. https://doi.org/10.1080/01605682.2020.1806746
   Web of Science ®Google Scholar
• Tan, Z., & Zhang, A. (2011). Online hierarchical scheduling: An approach using mathematical programming. Theoretical Computer Science, 412(3), 246–256. https://doi.org/10.1016/j.tcs.2009.08.014
   Web of Science ®Google Scholar
• Xiao, M., Ding, L., Zhao, S., & Li, W. (2020). Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1. In National Conference of Theoretical Computer Science (pp. 47–56). Springer.
   Google Scholar
• Xiao, M., Liu, X., & Li, W. (2021). Semi-online early work maximization problem on two hierarchical machines with partial information of processing time. In International Conference on Algorithmic Applications in Management (pp. 146–156). Springer.
   Google Scholar
• Xiao, M., Wu, G., & Li, W. (2019). Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs. In National Conference of Theoretical Computer Science (pp. 95–108). Springer.
   Google Scholar
• Xin, X., Mou, M., & Mu, G. H. (2016). Scheduling jobs online on linear hierarchical parallel machines. International Journal of Simulation–Systems, Science & Technology, 17(47), 40.1–40.5.
   Google Scholar
• Zhang, A., Jiang, Y., Fan, L., & Hu, J. (2015). Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. Journal of Combinatorial Optimization, 29(4), 781–795. https://doi.org/10.1007/s10878-013-9627-7
   Web of Science ®Google Scholar
• Zhang, A., Jiang, Y., & Tan, Z. (2009). Online parallel machines scheduling with two hierarchies. Theoretical Computer Science, 410(38–40), 3597–3605. https://doi.org/10.1016/j.tcs.2009.04.007
   Web of Science ®Google Scholar
• Zhou, H., Jiang, Y., Zhou, P., Ji, M., & Zhao, Y. (2017). Total completion time minimization scheduling on two hierarchical uniform machines. Theoretical Computer Science, 702, 65–76. https://doi.org/10.1016/j.tcs.2017.08.016
   Web of Science ®Google Scholar