On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times

References

• Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & van de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31–54. doi:10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R
   Google Scholar
• Fang, Y., Lu, X. W., & Liu, P. H. (2011). Online batch scheduling on parallel machines with delivery times. Theoretical Computer Science, 412(39), 5333–5339. doi:10.1016/j.tcs.2011.06.011
   Web of Science ®Google Scholar
• Gong, H., & Tang, L. X. (2011). Scheduling production on parallel machines and batch delivery with limited waiting time constraint. Control and Decision, 26(6), 921–924. MR2866367.
   Google Scholar
• Gong, H., Tang, L. X., & Leung, J. Y. T. (2016). Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost. Naval Research Logistics (Nrl), 63(6), 492–502. doi:10.1002/nav.21715
   Web of Science ®Google Scholar
• Hoogeveen, J. A., & Vestjens, A. P. A. (2000). A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM Journal on Discrete Mathematics, 13(1), 56–63. doi:10.1137/S0895480196296823
   Web of Science ®Google Scholar
• Jiao, C. W., Li, W. H., & Yuan, J. J. (2014). A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines. Asia-Pacific Journal of Operational Research, 31(04), 1450030. doi:10.1142/S0217595914500304
   Web of Science ®Google Scholar
• Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, P. H. Zipkin, & A. H. G. Rinnooy Kan (Eds.), Logistics of Production and Inventory (pp. 445–522). North-Holland, Amsterdam: Handbooks in Operation Research and Management Science.
   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. doi:10.1287/opre.40.4.764
   Web of Science ®Google Scholar
• Li, W. H., Yuan, J. J., & Lin, Y. X. (2007). A note on special optimal batching structures to minimize total weighted completion time. Journal of Combinatorial Optimization, 14(4), 475–480. doi:10.1007/s10878-007-9070-8
   Web of Science ®Google Scholar
• Li, W. H., & Yuan, J. J. (2011). Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. Information Processing Letters, 111(18), 907–911. doi:10.1016/j.ipl.2011.06.008
   Web of Science ®Google Scholar
• Liu, P. H., Lu, X. W., & Fang, Y. (2012). A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. Journal of Scheduling, 15(1), 77–81. doi:10.1007/s10951-009-0154-4
   Web of Science ®Google Scholar
• Liu, P. H., & Lu, X. W. (2015a). Online scheduling on two parallel machines with release dates and delivery times. Journal of Combinatorial Optimization, 30(2), 347–359. doi:10.1007/s10878-014-9760-y
   Web of Science ®Google Scholar
• Liu, P. H., & Lu, X. W. (2015b). Online unbounded batch scheduling on parallel machines with delivery times. Journal of Combinatorial Optimization, 29(1), 228–236. doi:10.1007/s10878-014-9706-4
   Web of Science ®Google Scholar
• Tang, L. X., & Gong, H. (2008). A hybrid two-stage transportation and batch scheduling problem. Applied Mathematical Modelling, 32(12), 2467–2479. doi:10.1016/j.apm.2007.09.028
   Web of Science ®Google Scholar
• Tang, L. X., Gong, H., Liu, J. Y., & Li, F. (2014). Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations. Naval Research Logistics (Nrl), 61(4), 269–285. doi:10.1002/nav.21582
   Web of Science ®Google Scholar
• Tian, J., Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2009). Online scheduling on unbounded parallel-batch machines to minimize the makespan. Information Processing Letters, 109(21–22), 1211–1215. doi:10.1016/j.ipl.2009.08.008
   Web of Science ®Google Scholar
• Tian, J., Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2012). An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Applied Mathematics, 160(7–8), 1191–1210. doi:10.1016/j.dam.2011.12.002
   Web of Science ®Google Scholar
• Tian, J., Fu, R. Y., & Yuan, J. J. (2007). On-line scheduling with delivery time on a single batch machine. Theoretical Computer Science, 374(1–3), 49–57. doi:10.1016/j.tcs.2006.12.001
   Web of Science ®Google Scholar
• Tian, J., Fu, R. Y., & Yuan, J. J. (2014). Online over time scheduling on parallel-batch machines: A survey. Journal of the Operations Research Society of China, 2(4), 445–454. doi:10.1007/s40305-014-0060-0
   Google Scholar
• Yuan, J. J., Li, S. S., Tian, J., & Fu, R. Y. (2009). A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. Journal of Combinatorial Optimization, 17(2), 206–213. doi:10.1007/s10878-007-9108-y
   Web of Science ®Google Scholar
• Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). A review of production planning and scheduling models in the semiconductor industry, part I: System characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics, 24, 47–61. doi:10.1080/07408179208964233
   Web of Science ®Google Scholar
• Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1994). A survey of production planning and scheduling models in the semiconductor industry, part II: Shop-floor control. IIE Transactions on Scheduling and Logistics, 26, 44–55. doi:10.1080/07408179408966627
   Web of Science ®Google Scholar
• Zhang, G. C., Cai, X. Q., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48(3), 241–258. doi:10.1002/nav.5
   Web of Science ®Google Scholar
• Zhang, G. C., Cai, X. Q., & Wong, C. K. (2003). Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35(2), 175–181. doi:10.1080/07408170304378
   Web of Science ®Google Scholar