A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (original) (raw)
Access this article
Subscribe and save
- Starting from 10 chapters or articles per month
- Access and download chapters and articles from more than 300k books and 2,500 journals
- Cancel anytime View plans
Buy Now
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
Instant access to the full article PDF.
References
- Brucker, P., Gladky, A., Hoogeveen, H., Kovalyvov, M. Y., Potts, C. N., Tautehahn, T., & Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31–54.
Article Google Scholar - Chen, B., Deng, X., & Zang, W. (2001). On-line scheduling a batch processing system to minimize total weighted job completion time. In Lecture notes in computer science (Vol. 2223, pp. 380–389). Berlin: Springer.
Google Scholar - Cheng, T. C. E., Ng, C. T., Yuan, J. J., & Liu, Z. H. (2004). Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics, 51, 949–958.
Article 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 Discrete Mathematics, 5, 287–326.
Article Google Scholar - Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219–236.
Article Google Scholar - Lee, C. Y., Uzsoy, R., & Martin Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764–775.
Article Google Scholar - Li, S., Li, G., Wang, X., & Liu, Q. (2005). Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letters, 33, 157–164.
Article Google Scholar - Liu, Z., & Yu, W. (2000). Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105, 129–136.
Article Google Scholar - Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2002). A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Operations Research Letters, 30, 66–68.
Article Google Scholar - Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. Journal of Scheduling, 6, 483–490.
Article Google Scholar - Nong, Q. Q., Cheng, T. C. E., & Ng, C. T. (2008). An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Operations Research Letters, 36, 584–588.
Article Google Scholar - Tian, J., Fu, R., & Yuan, J. (2009). A best online algorithm for scheduling on two parallel batch machines. Theoretical Computer Science, 410, 2291–2294.
Article Google Scholar - Uzsoy, R. (1994). A single batch processing machine with non-identical job sizes. International Journal of Production Research, 32, 1615–1635.
Article Google Scholar - Yuan, J. J., Liu, Z. H., Ng, C. T., & Cheng, T. C. E. (2004). The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science, 320, 199–212.
Article Google Scholar - Zhang, G., Cai, X., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241–258.
Article Google Scholar - Zhang, G., Cai, X., & Wong, C. K. (2003). Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35, 175–181.
Article Google Scholar