Semi-online scheduling of two job types on a set of multipurpose machines

References

• Albers, S., & Hellwig, M. (2012). Semi-online scheduling revisited. Theoretical Computer Science, 443(Supplement C), 1–9.
   Google Scholar
• Angelelli, E. (2000). Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Central European Journal of Operations Research, 8(4).
   Google Scholar
• Angelelli, E., Speranza, M. G., Szoldatics, J., & Tuza, Z. (2010). Geometric representation for semi on-line scheduling on uniform processors. Optimization Methods & Software, 25(3), 421–428.
   Web of Science ®Google Scholar
• Angelelli, E., Speranza, M. G., & Tuza, Z. (2003). Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica, 37(4), 243–262.
   Web of Science ®Google Scholar
• Angelelli, E., Speranza, M. G., & Tuza, T. (2006). New bounds and algorithms for on-line scheduling: Two identical processors, known sum and upper bound on the tasks. Discrete Mathematics & Theoretical Computer Science, 8(1).
   Web of Science ®Google Scholar
• Angelelli, E., Speranza, M. G., & Tuza, Z. (2008). Semi-online scheduling on two uniform processors. Theoretical Computer Science, 393(1), 211–219.
   Web of Science ®Google Scholar
• Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assignments. Journal of Algorithms, 18(2), 221–237.
   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.
   Web of Science ®Google Scholar
• Brucker, P. (2007). Scheduling algorithms (Vol. 3). Springer.
   Google Scholar
• Cai, S. (2002). Semi online scheduling on three identical machines. Journal of Wenzhou Teachers College, 23, 1–3.
   Google Scholar
• Cheng, T. E., Kellerer, H., & Kotov, V. (2005). Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science, 337(1–3), 134–146.
   Web of Science ®Google Scholar
• Dósa, G., & He, Y. (2004). Semi-online algorithms for parallel machine scheduling problems. Computing, 72(3), 355–363.
   Web of Science ®Google Scholar
• Epstein, L., & Levin, A. (2011). Scheduling with processing set restrictions: Ptas results for several variants. International Journal of Production Economics, 133(2), 586–595.
   Web of Science ®Google Scholar
• Glass, C. A., & Kellerer, H. (2007). Parallel machine scheduling with job assignment restrictions. Naval Research Logistics (NRL), 54(3), 250–257.
   Web of Science ®Google Scholar
• Goldberg, N., & Karhi, S. (2017). Packing into designated and multipurpose bins: A theoretical study and application to the cold chain. Omega, 71, 85–92.
   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
• He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62(3), 179–187.
   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.
   Web of Science ®Google Scholar
• Jiang, Y.-W., He, Y., & Tang, C.-M. (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.
   Google Scholar
• Karhi, S., & Shabtay, D. (2014). Online scheduling of two job types on a set of multipurpose machines. International Journal of Production Economics, 150, 155–162.
   Web of Science ®Google Scholar
• Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Z. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21(5), 235–242.
   Web of Science ®Google Scholar
• Lee, K., Hwang, H.-C., & Lim, K. (2014). Semi-online scheduling with gos eligibility constraints. International Journal of Production Economics, 153, 204–214.
   Web of Science ®Google Scholar
• Lee, K., Leung, J. Y.-T., & Pinedo, M. L. (2010). Makespan minimization in online scheduling with machine eligibility. 4OR: A quarterly. Journal of Operations Research, 8(4), 331–364.
   Web of Science ®Google Scholar
• Lee, K., & Lim, K. (2013). Semi-online scheduling problems on a small number of machines. Journal of Scheduling, 16(5), 461–477.
   Web of Science ®Google Scholar
• Leung, J. Y.-T., & Li, C.-L. (2008). Scheduling with processing set restrictions: A survey. International Journal of Production Economics, 116(2), 251–262.
   Web of Science ®Google Scholar
• Li, C.-L., & Wang, X. (2010). Scheduling parallel machines with inclusive processing set restrictions and job release times. European Journal of Operational Research, 200(3), 702–710.
   Web of Science ®Google Scholar
• Liu, M., Chu, C., Xu, Y., & Zheng, F. (2011). Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. Journal of Combinatorial Optimization, 21(1), 138–149.
   Web of Science ®Google Scholar
• Luo, T., Xu, Y., Luo, L., & He, C. (2014). Semi-online scheduling with two gos levels and unit processing time. Theoretical Computer Science, 521, 62–72.
   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.
   Web of Science ®Google Scholar
• Seiden, S., Sgall, J., & Woeginger, G. (2000). Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27(5), 215–221.
   Web of Science ®Google Scholar
• Shabtay, D., & Karhi, S. (2012). Online scheduling of two job types on a set of multipurpose machines with unit processing times. Computers & Operations Research, 39(2), 405–412.
   Web of Science ®Google Scholar
• Sleator, D. D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2), 202–208.
   Web of Science ®Google Scholar
• Tan, Z., & He, Y. (2002). Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters, 30(6), 408–414.
   Web of Science ®Google Scholar
• Tan, Z., He, Y., & Epstein, L. (2005). Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Information and Computation, 196(1), 57–70.
   Web of Science ®Google Scholar
• Tan, Z., & Zhang, A. (2013). Online and semi-online scheduling (pp. 2191–2252). New York, NY: Springer.
   Google Scholar
• Wu, Y., Huang, Y., & Yang, Q. (2008). Semi-online multiprocessor scheduling with the longest processing time. Journal of Zhejiang University, 35, 23–26 (in Chinese).
   Google Scholar
• Wu, Y., Ji, M., & Yang, Q. (2012). Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. International Journal of Production Economics, 135(1), 367–371.
   Web of Science ®Google Scholar
• Zhang, A., Jiang, Y., & Tan, Z. (2009). Online parallel machines scheduling with two hierarchies. Theoretical Computer Science, 410(38), 3597–3605.
   Web of Science ®Google Scholar