Skip to main content
Springer Nature Link
Log in

Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6124))

Included in the following conference series:

Abstract

In this paper, we consider the bounded parallel-batch scheduling problem on unrelated parallel machines. Problems R m |B|F are NP-hard for any objective function F. For this reason, we discuss the special case with p ij  = p i for i = 1, 2, ⋯ , m , j = 1, 2, ⋯ , n. We give optimal algorithms for the general scheduling to minimize total weighted completion time, makespan and the number of tardy jobs. And we design pseudo-polynomial time algorithms for the case with rejection penalty to minimize the makespan and the total weighted completion time plus the total penalty of the rejected jobs, respectively.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discrete Math. 13, 64–78 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, 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 

  3. Cao, Z.G., Yang, X.G.: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science 410(27-29), 2732–2745 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, B., Deng, X.T., Zang, W.N.: On-line scheduling a batch processing system to minimize total weighted job completion time. Journal of Combinatorial Optimization 8, 85–95 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng, Y.S., Sun, S.J.: Scheduling linear deteriorating job with rejection on a single machine. European Journal of Operational Research 194, 18–27 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  6. Deng, X.T., Zhang, Y.Z.: Minimizing mean response time in batch processing system. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 231–240. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. Journal of Algorithms 49, 175–191 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time. Operations Research Lettars 30, 415–420 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Graham, R.L., Lawler, L.J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Disc. Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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 

  11. Li, S.G., Li, G.J., Wang, X.H.: Minimizing total weighted completion time on parallel unbounded batch machines. Journal of Software 17, 2063–2068 (2006)

    Article  MATH  Google Scholar 

  12. Lu, L.F., Cheng, T.C.E., Yuan, J.J., Zhang, L.Q.: Bounded single-machine parallel-batch scheduling with release dates and rejection. Computer and Operations Research 36, 2748–2751 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Miao, C.X., Zhang, Y.Z.: On-line scheduling with rejection on identical parallel machines. Journal of System Science and Complexity 19, 431–435 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Webster, S., Baker, K.R.: Scheduling groups of jobs on a single machine. Operations Research 43, 692–703 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhang, Y.Z., Wang, Z.Z., Wang, C.Y.: The “transform lemma” and its application in batch scheduling. Journal of Systems Science and Mathematical Sciences 22(3), 328–333 (2002)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Operations Research and Management Sciences, Qufu Normal University, Rizhao, Shandong, 276826, China

    Cuixia Miao, Yuzhong Zhang & Chengfei Wang

  2. School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong, 273165, China

    Cuixia Miao

Authors
  1. Cuixia Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuzhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chengfei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warwick Business School/ DIMAP - Centre for Discrete Mathematics and its Applications Coventry, University of Warwick, CV4 7AL, UK

    Bo Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miao, C., Zhang, Y., Wang, C. (2010). Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14355-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14354-0

  • Online ISBN: 978-3-642-14355-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics