Skip to main content
SpringerLink
Log in

Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines

  • Conference paper
Computing and Combinatorics (COCOON 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3106))

Included in the following conference series:

Abstract

We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B<n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the same time. We present a polynomial time approximation scheme (PTAS) for this problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Kise, H., Ibaraki, T., Mine, H.: Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society of Japan 22, 205–224 (1979)

    MATH  MathSciNet  Google Scholar 

  3. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Ikura, Y., Gimple, M.: Scheduling algorithms for a single batch processing machine. Operations Research Letters 5, 61–65 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Li, C.L., Lee, C.Y.: Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research 96, 564–569 (1997)

    Article  MATH  Google Scholar 

  7. Wang, C.S., Uzsoy, R.: A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers and Operations Research 29, 1621–1640 (2002)

    Article  MathSciNet  Google Scholar 

  8. Deng, X., Feng, H.D., Li, G.J.: A PTAS for semiconductor burn-in scheduling. Submitted to Journal of Combinatorial Optimization

    Google Scholar 

  9. Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th annual IEEE Symposium on Foundations of Computer Science, pp. 134–139 (1989)

    Google Scholar 

  10. Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Google Scholar 

  11. Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, UCLA (1955)

    Google Scholar 

  12. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Macmillan Press, Basingstoke (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Information Science, Yantai University, Yantai, 264005, P.R. China

    Shuguang Li

  2. Institute of Software, Chinese Academy of Sciences, Beijing, 100080, P.R. China

    Guojun Li

  3. School of Mathematics and System Science, Shandong University, Jinan, 250100, P.R. China

    Guojun Li

  4. Mathematics Department, Tianjin Normal University, Tianjin, 300074, P. R. China

    Shaoqiang Zhang

Authors
  1. Shuguang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guojun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shaoqiang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea

    Kyung-Yong Chwa

  2. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    J. Ian J. Munro

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, S., Li, G., Zhang, S. (2004). Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27798-9_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22856-1

  • Online ISBN: 978-3-540-27798-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation