Skip to main content
SpringerLink
Log in

A Single Machine Scheduling Problem with Time Slot Costs

  • Chapter
  • First Online:
Recent Advances in Computer Science and Information Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 126))

Abstract

In this paper, we consider a single machine scheduling problem in which processing a job will incur some cost which is relevant with the time slots occupied by the job. The objective is to minimize the makespan plus the total time slot costs. We prove that the problem is strongly NP-hard and analyze a special case with nonincreasing time slot costs.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Wan, G., Qi, X.: Scheduling with variable time slot costs. Naval Research Logistics 57, 159–171 (2010)

    MathSciNet  MATH  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  3. Lee, C.-Y.: Machine scheduling with availability constraints. In: Leung, J.Y.-T. (ed.) Handbook of scheduling: Algorithms, Models and Performance Analysis. ch. 22. CRC Press, Boca Raton (2004)

    Google Scholar 

  4. Lee, C.-Y., Liman, S.D.: Single-machine flow-time scheduling with scheduled maintenance. Acta Inform 29, 375–382 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Schmidt, G.: Scheduling with limited machine availability. Eur. J. Oper. Res. 121, 1–15 (2000)

    Article  MATH  Google Scholar 

  6. Biskup, D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315–329 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. Eur. J. Oper. Res. 152, 1–13 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Janiak, A., Rudek, R.: The learning effect: Getting to the core of the problem. Inform. Process Lett. 103, 183–187 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lin, B.M.T.: Complexity results for single-machine scheduling with positional learning effects. J. Oper. Res. Soc. 58, 1099–1102 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shanghai University, 99 Shangda Road, BaoShan District, Shanghai, China

    Weiya Zhong & Xiaolei Liu

Authors
  1. Weiya Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaolei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weiya Zhong .

Editor information

Editors and Affiliations

  1. , College of Communication Engineering, Jilin University, Room 313, Building No.1, Changchun, Nanhu Avenue 5372, Jilin, 130012, China, People's Republic

    Zhihong Qian

  2. , Department of Electrical Engineering, The University of Mississippi, Anderson Hall 314, Mississippi, 38677, Mississippi, USA

    Lei Cao

  3. , Department of Electrical and Computer En, Naval Postgraduate School, Rm. 452 Spanagel Bldg. 232, Dyer Road 833, Monterey, 93943-5121, California, USA

    Weilian Su

  4. , Faculty of Computing, London Metropolitan University, Holloway Road 166-220, London, N7 8DB, United Kingdom

    Tingkai Wang

  5. , College of Software, Changchun University of Science and Tech, Changchun, Jilin, 130022, China, People's Republic

    Huamin Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Zhong, W., Liu, X. (2012). A Single Machine Scheduling Problem with Time Slot Costs. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25766-7_90

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25766-7_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation