Skip to main content

Job Shop Scheduling in Single Machine: An Overview

  • Conference paper
  • First Online:
  • 1192 Accesses

Part of the book series: Lecture Notes in Mechanical Engineering ((LNME))

Abstract

Scheduling is defined as decision-making activities used in the daily activities of manufacturing or service industries. There are various types of scheduling that are related to production, personnel, vehicle, project scheduling, etc. In this paper, we will discuss specifically the scheduling in the context of production system, namely job shop scheduling. This paper aims to review several job shop scheduling methods on a single machine. Subsequently, this paper provides an overall overview of the development of job shop scheduling methods for single machine condition. Later on, the job shop scheduling methods for single machine condition are categorized by deterministic and stochastic job processing times.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 3rd edn. Prentice Hall, New York (2008)

    MATH  Google Scholar 

  2. Nahmias, F., Olsen, T.: Production and Operation Analysis, 7th edn. Waveland Press, Illinois (2015)

    Google Scholar 

  3. Nezhad, M., Abdullah, S.: Job shop scheduling: classification, constraints, and objective function. Int. J. Comput. Inf. Technol. 11(4), 429–434 (2017)

    Google Scholar 

  4. Sipper, D., Bulfin, R.: Production: Planning, Control, and Integration. McGraw-Hill, New York (1997)

    Google Scholar 

  5. Tyagi, N.: Single machine scheduling model with total tardiness problem. Indian J. Sci. Technol. 9(37), 4–14 (2016)

    Article  Google Scholar 

  6. Shahrabi, J., Adibi, M.A., Mahootchi, M.: A reinforcement learning approach to parameter estimation in dynamic job shop scheduling. Comput. Ind. Eng. 110, 75–82 (2017)

    Article  Google Scholar 

  7. Chaoch, I., Driss, O.B., Ghedira, K.: A modified ant colony optimization algorithm for the distributed job shop scheduling problem. Proc. Comput. Sci. 112, 296–305 (2017)

    Article  Google Scholar 

  8. Robert, O., Hankun, Z., Shifeng, L., Borrut, B.: Improved heuristic Kalman algorithm for solving multi-objective flexible job shop scheduling problem. Proc. Manuf. 17, 895–902 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yosi Agustina Hidayat .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hidayat, Y.A., Setio, K.V., Winata, H., Radhiyani, N. (2020). Job Shop Scheduling in Single Machine: An Overview. In: Osman Zahid, M., Abd. Aziz, R., Yusoff, A., Mat Yahya, N., Abdul Aziz, F., Yazid Abu, M. (eds) iMEC-APCOMS 2019. iMEC-APCOMS 2019. Lecture Notes in Mechanical Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-15-0950-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0950-6_31

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0949-0

  • Online ISBN: 978-981-15-0950-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics