Skip to main content
SpringerLink
Log in

On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

The on-line problem of scheduling on a batch processing machine with nonidentical job sizes to minimize makespan is considered. The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. The paper deals with two variants: the case only with two distinct arrival times and the general case. For the first case, an on-line algorithm with competitive ratio 119/44 is given. For the latter one, a simple algorithm with competitive ratio 3 is given. For both variants the better ratios can be obtained if the problem satisfies proportional assumption.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Azizoglu M, Webster S. Scheduling a batch processing machine with non-identical job sizes, Int J Prod Res, 2000, 38:2173–2184.

    Article  MATH  Google Scholar 

  2. Brucker P, Gladky A, Hoogeveen H, et al. Scheduling a batching machine, J Scheduling, 1998, 1:31–54.

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandru V, Lee CY, Uzsoy R. Minimizing total completion time on a batch processing machine with job families, Oper Res Lett, 1993, 13:61–65.

    Article  MATH  MathSciNet  Google Scholar 

  4. Ghazvini FJ, Dupont L. Minimizing mean flow times criteria on single batch processing machine with nonidentical job sizes, Int J Prod Econ, 1998, 55:273–280.

    Article  Google Scholar 

  5. Hochbaum DS, Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime, Oper Res, 1997, 45:874–885.

    MATH  Google Scholar 

  6. Ikura Y, Gimple M, Scheduling algorithms for a single batching processing machine, Oper Res Lett, 1986, 5:61–65.

    Article  MATH  MathSciNet  Google Scholar 

  7. Lee CY, Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals, Int J Prod Res, 1999, 37:219–236.

    Article  MATH  Google Scholar 

  8. Lee CY, Uzsoy R, Martin-vega, LA. Efficient algorithms for scheduling semiconductor burn-in operations, Oper Res, 1992, 40:764–775.

    Article  MATH  MathSciNet  Google Scholar 

  9. Lenstra JK, Shmoys DB. Computing near-optimal schedules, P. Chrétienne et al. (Editors). Scheduling Theory and Its Application, New York: Wiley, 1995.

    Google Scholar 

  10. Liu Z, Yu W, Scheduling one batch processor subject to job release dates, Disc Appl Math, 2000, 105: 129–136.

    Article  MATH  MathSciNet  Google Scholar 

  11. Potts CN, Kovalyov MY, Scheduling with batching: a review, Eur J Oper Res, 2000, 120:228–249.

    Article  MATH  MathSciNet  Google Scholar 

  12. Uzsoy R. A single batch processing machine with nonidentical job sizes, Int J Prod Res, 1994, 32:1615–1635.

    Article  MATH  Google Scholar 

  13. Zhang G, Cai X, Lee CY, et al, Minimizing makespan on a single batch processing machine with nonidentical job sizes, Naval Res Logist, 2001, 48:226–240.

    Article  MATH  MathSciNet  Google Scholar 

  14. Zhang G, Cai X, Wong CK. On-line algorithms for minimizing makespan on batch processing machines, Naval Res Logist, 2001, 48:241–258.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Math., Zhejiang Univ., 310027, Hangzhou, China

    Shi Yongqiang & Yao Enyu

Authors
  1. Shi Yongqiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yao Enyu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yongqiang, S., Enyu, Y. On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes. Appl. Math. Chin. Univ. 20, 297–304 (2005). https://doi.org/10.1007/s11766-005-0005-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-005-0005-9

MR Subject Classification

Keywords

Search

Navigation