Skip to main content
SpringerLink
Log in

Flexible Job-Shop Scheduling with Changeover Priorities

  • Conference paper
  • First Online:
Machine Learning, Optimization, and Data Science (LOD 2021)

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

  • 1576 Accesses

Abstract

In a job shop, operators run different machines concurrently, which obviously may result in multiple jobs being completed at the same time. It becomes a concern whenever jobs with lower priorities are serviced over jobs with higher priorities. Our goal is to generate up-to-date changeover schedules that prioritize servicing high-priority jobs without jeopardizing schedule optimality in real-time. We formulate flexible job-shop scheduling with changeover priorities (FJSCP) based on the knapsack model and develop an algorithm based on greedy methodology. Results show that depending on a pairwise combinations of pivot selection modes our method could save up to \(53\%\) in idle time and up to \(12\%\) in makespan when compared with the traditional FCFS baseline.

This work is funded by the University of the Fraser Valley’s work-study grant program.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Andrade-Pineda, J.L., Canca, D., Gonzalez-R, P.L., Calle, M.: Scheduling a dual-resource flexible job shop with makespan and due date-related criteria. Ann. Oper. Res. 291(1), 5–35 (2020). https://doi.org/10.1007/s10479-019-03196-0

    Article  MathSciNet  Google Scholar 

  2. Bożek, A., Werner, F.: Flexible job shop scheduling with lot streaming and sublot size optimisation. Int. J. Prod. Res. 56(19), 6391–6411 (2018)

    Article  Google Scholar 

  3. Chan, F., Wong, T., Chan, L.: Flexible job-shop scheduling problem under resource constraints. Int. J. Prod. Res. 44(11), 2071–2089 (2006)

    Article  MATH  Google Scholar 

  4. Dauzère-Pérès, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using Tabu search. Ann. Oper. Res. 70, 281–306 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fattahi, P., Jolai, F., Arkat, J.: Flexible job shop scheduling with overlapping in operations. Appl. Math. Model. 33(7), 3076–3087 (2009)

    Article  MATH  Google Scholar 

  6. Gong, G., Chiong, R., Deng, Q., Gong, X.: A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. Int. J. Prod. Res. 58(14), 4406–4420 (2020)

    Article  Google Scholar 

  7. Gong, X., Deng, Q., Gong, G., Liu, W., Ren, Q.: A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. Int. J. Prod. Res. 56(7), 2506–2522 (2018)

    Article  Google Scholar 

  8. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966)

    Article  MATH  Google Scholar 

  9. Kletzander, L., Musliu, N.: Solving the general employee scheduling problem. Comput. Oper. Res. 113, 104794 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  10. Krause, J., Cordeiro, J., Parpinelli, R.S., Lopes, H.S.: A survey of swarm algorithms applied to discrete optimization problems. In: Yang, X.S., Cui, Z., Xiao, R., Gandomi, A.H., Karamanoglu, M. (eds.) Swarm Intelligence and Bio-inspired Computation, pp. 169–191. Elsevier, Oxford (2013)

    Chapter  Google Scholar 

  11. Luo, X., Qian, Q., Fu, Y.F.: Improved genetic algorithm for solving flexible job shop scheduling problem. Procedia Comput. Sci. 166, 480–485 (2020)

    Article  Google Scholar 

  12. Panda, A., Pani, S.: A symbiotic organisms search algorithm with adaptive penalty function to solve multi-objective constrained optimization problems. Appl. Soft Comput. 46, 344–360 (2016)

    Article  Google Scholar 

  13. Ravindran Vijayalakshmi, V., Schröder, M., Tamir, T.: Scheduling games with machine-dependent priority lists. Theor. Comput. Sci. 855, 90–103 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  14. Salkin, H.M., De Kluyver, C.A.: The knapsack problem: a survey. Naval Res. Logist. Q. 22(1), 127–144 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shen, L., Dauzère-Pérès, S., Neufeld, J.S.: Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 265(2), 503–516 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  16. Villarrubia, G., De Paz, J.F., Chamoso, P., la Prieta, F.D.: Artificial neural networks used in optimization problems. Neurocomputing 272, 10–16 (2018)

    Article  Google Scholar 

  17. Wang, L., Cai, J., Li, M., Liu, Z.: Flexible job shop scheduling problem using an improved ant colony optimization. Sci. Program. 2017, 9016303 (2017)

    Google Scholar 

  18. Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38(4), 3563–3573 (2011)

    Article  Google Scholar 

  19. Zhu, Z., Zhou, X.: An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints. Comput. Ind. Eng. 140, 106280 (2020)

    Article  Google Scholar 

  20. Zhu, Z., Zhou, X.: Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time. Comput. Ind. Eng. 149, 106781 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, University of the Fraser Valley, Abbotsford, Canada

    Holden Milne, Opeyemi Adesina, Russell Campbell & Barbara Friesen

  2. School of Business, University of the Fraser Valley, Abbotsford, Canada

    Masud Khawaja

Authors
  1. Holden Milne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Opeyemi Adesina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Russell Campbell
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Barbara Friesen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Masud Khawaja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Holden Milne .

Editor information

Editors and Affiliations

  1. University of Catania, Catania, Italy

    Giuseppe Nicosia

  2. Department of Computer Science, University of Reading, Reading, UK

    Varun Ojha

  3. Department of Computer Science, University of Oxford, Oxford, UK

    Emanuele La Malfa

  4. Cambridge Judge Business School, University of Cambridge, Cambridge, UK

    Gabriele La Malfa

  5. Department of Biochemistry, University of Cambridge, Cambridge, UK

    Giorgio Jansen

  6. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  7. University of Catania, Catania, Italy

    Giovanni Giuffrida

  8. Department of Informatics, Dana-Farber Cancer Institute, Boston, MA, USA

    Renato Umeton

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Milne, H., Adesina, O., Campbell, R., Friesen, B., Khawaja, M. (2022). Flexible Job-Shop Scheduling with Changeover Priorities. In: Nicosia, G., et al. Machine Learning, Optimization, and Data Science. LOD 2021. Lecture Notes in Computer Science(), vol 13163. Springer, Cham. https://doi.org/10.1007/978-3-030-95467-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-95467-3_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-95466-6

  • Online ISBN: 978-3-030-95467-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation