Online Over Time Scheduling on Parallel-Batch Machines: A Survey

Anderson, E.J., Potts, C.N.: Online scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res. 29, 686–697 (2004)

Avramidis, A.N., Healy, K.J., Uzsoy, R.: Control of a batch processing machine: a computational approach. Int. J. Prod. Res. 36, 3167–3181 (1998)

Averbakh, I., Baysan, M.: Batching and delivery in semi-online distribution systems. Discret. Appl. Math. 161, 28–42 (2013)

Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. J. Sched. 1, 31–54 (1998)

Brucker, P.: Scheduling Algorithms. Springer, Berlin (2003)

Brucker, P., Knust, S.: Complexity results for scheduling problems, http://www.mathematik.uniosnabrueck.de/research/OR/class/ (2007)

Chen, B., Deng, X.T., Zang, W.: On-line scheduling a batch processing system to minimize total weighted job completion time. J. Comb. Optim. 8, 85–95 (2004)

Cheng, T.C.E., Kellerer, H., Kotov, V.: Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337, 134–146 (2005)

Deng, X.T., Poon, C.K., Zhang, Y.Z.: Approximation algorithms in batch processing. J. Comb. Optim. 7, 247–257 (2003)

Fang, Y., Liu, P.H., Lu, X.W.: Optimal on-line algorithms for one batch machine with grouped processing times. J. Comb. Optim. 22, 509–516 (2011)

Fang, Y., Lu, X.W., Liu, P.H.: Online batch scheduling on parallel machines with delivery times. Theor. Comput. Sci. 412, 5333–5339 (2011)

Fu, R.Y., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110, 444–450 (2010)

Fu, R.Y., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: A best online algorithm for a single parallel batch machine scheduling with $$f$$ f job families. Opera. Res. Lett. 41, 216–219 (2013)

Fu, R.Y., Tian, J., Yuan, J.J., Lin, Y.X.: On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theor. Comput. Sci. 374, 196–202 (2007)

Fu, R.Y., Tian, J., Yuan, J.J., He, C.: On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper. Res. Lett. 36, 255–258 (2008)

Fu, R.Y., Tian, J., Yuan, J.J.: On-line scheduling on an unbounded batch machine to minimize makespan of two families of jobs. J. Sched. 12, 91–97 (2009)

Hall, N.G., Posner, M.E., Potts, C.N.: Online scheduling with known arrival times. Math. Oper. Res. 34, 92–102 (2009)

Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for single-machine scheduling. Lect. Notes Comput. Sci. 1996, 404–414 (1084)

Hoogeveen, J.A., Vestjens, A.P.A.: A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J. Discret. Math. 13, 56–63 (2000)

Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity, in Logistics of Production and Inventory. In: Graves, S.C., Zipkin, P.H., Rinnooy Kan, A.H.G. (eds.) Handbooks Operation Research Management Science, pp. 445–522. North-Holland, Amsterdam (1993)

Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40, 764–775 (1992)

Lee, C.Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. I. J. Prod. Res. 37, 219–236 (1999)

Li, W.J., Zhang, Z.K., Liu, H.L., Yuan, J.J.: Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs. Inf. Process. Lett. 112, 503–508 (2012)

Li, W.H., Yuan, J.J.: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. Inf. Process. Lett. 111, 907–911 (2011)

Li, W.H., Zhang, Z.K., Yang, S.F.: Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead. Inf. Process. Lett. 112, 292–297 (2012)

Liu, Z.H., Yu, W.: Scheduling one batch processor subject to job release date. Discret. Appl. Math. 105, 129–136 (2000)

Liu, P.H., Lu, X.W., Fang, Y.: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. J. sched. 15, 77–81 (2012)

Liu, P.H., Lu, X.W.: Online unbounded batch scheduling on parallel machines with delivery times. Journal of Combinatorial Optimization (2014). doi: 10.1007/s10878-014-9706-4

Liu, H.L., Yuan, J.J.: Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart. Theor. Comput. Sci. 543, 24–36 (2014)

Ma, R., Wan, L., Wei, L.J., Yuan, J.J.: Online bounded-batch scheduling to minimize total weighted completion time on parallel machines. Int. J. Prod. Econ. 156, 31–38 (2014)

Mathirajan, M., Sivakumar, A.I.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int. J. Adv. Manuf. Technol. 29, 990–1001 (2006)

Nong, Q.Q., Yuan, J.J., Fu, R.Y., Lin, L., Tian, J.: The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan. Intern. J. Prod. Econ. 111, 435–440 (2008)

Nong, Q.Q., Cheng, T.C.E., Ng, C.T.: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Oper. Res. Lett. 36, 584–588 (2008)

Poon, C.K., Zhang, P.X.: Minimizing makespan in batch machine scheduling. Algorithmica 39, 155–174 (2004)

Poon, C.K., Yu, W.C.: A flexible online scheduling algorithm for batch machine with infinite capacity. Ann. Oper. Res. 133, 175–181 (2005)

Poon, C.K., Yu, W.C.: On-line scheduling algorithms for a batch machine with finite capacity. J. Comb. Optim. 9, 167–186 (2005)

Seiden, S., Sgall, J., Woeginger, G.: Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27, 215–221 (2000)

Tan, Z.Y., He, Y.: Semi-on-line problems on two identical machines with combined partial information. Oper. Res. Lett. 30, 408–414 (2002)

Tian, J., Fu, R.Y., Yuan, J.J.: On-line scheduling with delivery time on a single batch machine. Theor. Comput. Sci. 374, 49–57 (2007)

Tian, J., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Online scheduling on unbounded parallel-batch machines to minimize makespan. Inf. Process. Lett. 109, 1211–1215 (2009)

Tian, J., Fu, R.Y., Yuan, J.J.: A best online algorithm for scheduling on two parallel batch machines. Theor. Comput. Sci. 410, 2291–2294 (2009)

Tian, J., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Online scheduling on unbounded parallel-batch machines with incompatible job families. Theor. Comput. Sci. 412, 2380–2386 (2011)

Tian, J., Fu, R.Y., Yuan, J.J.: An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf. Process.g Lett. 111, 1048–1053 (2011)

Tian, J., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discret. Appl. Math. 160, 1191–1210 (2012)

Uzsoy, R., Lee, C.Y., Martin-Vega, L.A.: A review of production planning and scheduling models in the semiconductor industry, part I: system characteristics, performance evaluation and production planning. IIE Trans. Sched. Logist. 24, 47–61 (1992)

Uzsoy, R., Lee, C.Y., Martin-Vega, L.A.: A survey of production planning and scheduling models in the semiconductor industry, part II: shop-floor control. IIE Trans. Sched. Logist. 26, 44–55 (1994)

Yuan, J.J.: Online over time scheduling on unbounded p-batch machines to minimize the makespan: a survey http://www.paper.edu.cn (2010)

Yuan, J.J., Li, S.S., Tian, J., Fu, R.Y.: A best possible on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J. Comb. Optim. 17, 206–213 (2009)

Yuan, J.J., Fu, R.Y., Ng, C.T., Cheng, T.C.E.: A best on-line algorithm for unbounded parallel batch scheduling to minimize makespan with restarts. J. Sched. 14, 361–369 (2011)

Yuan, J.J., Ng, C.T., Cheng, T.C.E.: Best semi-online algorithms for unbounded parallel batch scheduling. Discret. Appl. Math. 159, 838–847 (2011)

Zhang, G.C., Cai, X.Q., Wong, C.K.: Online algorithms for minimizing makespan on batch processing machines. Nav. Res. Logist. 48, 241–258 (2001)

Zhang, G.C., Cai, X.Q., Wong, C.K.: Optimal online algorithms for scheduling on parallel batch processing machines. IIE Trans. 35, 175–181 (2003)