Skip to main content
SpringerLink
Log in

Scheduling

  • Chapter
  • First Online:
Computational Intelligence in Logistics and Supply Chain Management

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 244))

  • 2116 Accesses

Abstract

In this chapter we discuss scheduling problems and how methods from computational intelligence can be applied to them. We start with general considerations on scheduling problems and discuss variants and some simple solution concepts. After that some standard scheduling problems are discussed in more detail followed by a discussion of further scheduling problems relevant to logistics and supply chain management. After that we discus solution approaches from the field of computational intelligence with emphasis on encoding issues, especially in the context of using evolutionary algorithms. The paper ends with a discussion of the importance and success of using respective solution approaches especially from the area of metaheuristics .

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 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

References

  • Albers, S. (2003). Online algorithms: A survey. Mathematical Programming, 97(1–2), 3–26.

    Google Scholar 

  • Andresen, M., Bräsel, H., Mörig, M., Tusch, J., Werner, F., & Willenius, P. (2008). Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Mathematical and Computer Modelling, 48(7), 1279–1293.

    Article  Google Scholar 

  • Basnet, C., & Mize, J. H. (1994). Scheduling and control of flexible manufacturing systems: A critical review. International Journal of Computer Integrated Manufacturing, 7(6), 340–355.

    Article  Google Scholar 

  • Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154–160.

    Article  Google Scholar 

  • Behnke, D., & Geiger, M. J. (2012). Test instances for the flexible job shop scheduling problem with work centers. Working Paper. Hamburg: Helmut-Schmidt-Universität.

    Google Scholar 

  • Brucker, P., & Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin/Heidelberg: Springer.

    Google Scholar 

  • Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112(1), 3–41.

    Article  Google Scholar 

  • Cheng, R., Gen, M., & Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies. Computers & Industrial Engineering, 36(2), 343–364.

    Article  Google Scholar 

  • Czogalla, J., & Fink, A. (2012). Fitness landscape analysis for the no-wait flow-shop scheduling problem. Journal of Heuristics, 18(1), 25–51.

    Article  Google Scholar 

  • Davis, L. (1985). Job shop scheduling with genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and their Applications (Vol. 140). Pittsburgh, PA: Carnegie-Mellon University.

    Google Scholar 

  • Della Croce, F., Tadei, R., & Volta, G. (1995). A genetic algorithm for the job shop problem. Computers & Operations Research, 22(1), 15–24.

    Article  Google Scholar 

  • Dubois, D., Fargier, H., & Fortemps, P. (2003). Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. European Journal of Operational Research, 147(2), 231–252.

    Article  Google Scholar 

  • Dudek, R. A., Panwalkar, S. S., & Smith, M. L. (1992). The lessons of flowshop scheduling research. Operations Research, 40(1), 7–13.

    Article  Google Scholar 

  • Gambardella, L. M., & Mastrolilli, M. (2000). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1), 3–20.

    Article  Google Scholar 

  • Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35(9), 2892–2907.

    Article  Google Scholar 

  • Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129.

    Article  Google Scholar 

  • Gonçalves, J. F., de Magalhães Mendes, J. J., & Resende, M. G. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167(1), 77–95.

    Article  Google Scholar 

  • Gonçalves, J. F., Resende, M. G., & Mendes, J. J. (2011). A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. Journal of Heuristics, 17(5), 467–486.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Herroelen, W., De Reyck, B., & Demeulemeester, E. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers & Operations Research, 25(4), 279–302.

    Article  Google Scholar 

  • Hoogeveen, J. A., Lenstra, J. K., & Van de Velde, S. L. (1997). Sequencing and scheduling: An annotated bibliography. Eindhoven: Eindhoven University of Technology, Department of Mathematics and Computing Science.

    Google Scholar 

  • Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Sciences Research Project. Los Angeles: University of California.

    Google Scholar 

  • Kuo, I. H., Horng, S. J., Kao, T. W., Lin, T. L., Lee, C. L., Terano, T., & Pan, Y. (2009). An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Systems with Applications, 36(3), 7027–7032.

    Article  Google Scholar 

  • Lee, K. M., Yamakawa, T., & Lee, K. M. (1998). A genetic algorithm for general machine scheduling problems. In Knowledge-Based Intelligent Electronic Systems, 1998. Proceedings KES’98. 1998 Second International Conference on (Vol. 2, pp. 60–66). Piscataway, NJ: IEEE.

    Google Scholar 

  • Liebchen, C., Schachtebeck, M., Schöbel, A., Stiller, S., & Prigge, A. (2010). Computing delay resistant railway timetables. Computers and Operations Research, 37(5), 857–868.

    Article  Google Scholar 

  • Lin, T. L., Horng, S. J., Kao, T. W., Chen, Y. H., Run, R. S., Chen, R. J., Lai, J. L., & Kuo, I. H. (2010). An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications, 37(3), 2629–2636.

    Article  Google Scholar 

  • Liu, B., Wang, L., & Jin, Y. H. (2007). An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 37(1), 18–27.

    Article  Google Scholar 

  • Mendes, J. J. D. M., Gonçalves, J. F., & Resende, M. G. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research, 36(1), 92–109.

    Article  Google Scholar 

  • Nearchou, A. C., & Omirou, S. L. (2006). Differential evolution for sequencing and scheduling optimization. Journal of Heuristics, 12(6), 395–411.

    Article  Google Scholar 

  • Ouelhadj, D., & Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12(4), 417–431.

    Article  Google Scholar 

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35(10), 3202–3212.

    Article  Google Scholar 

  • Prins, C. (2000). Competitive genetic algorithms for the open-shop scheduling problem. Mathematical Methods of Operations Research, 52(3), 389–411.

    Article  Google Scholar 

  • Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis. Boca Raton, FL: CRC Press. Chapter 15.

    Google Scholar 

  • Ribas, I., Leisten, R., & Framiñan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8), 1439–1454.

    Article  Google Scholar 

  • Roshanaei, V., Naderi, B., Jolai, F., & Khalili, M. (2009). A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Generation Computer Systems, 25(6), 654–661.

    Article  Google Scholar 

  • Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1–18.

    Article  Google Scholar 

  • Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285.

    Article  Google Scholar 

  • Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevast’Janov, S. V., & Shmoys, D. B. (1997). Short shop schedules. Operations Research, 45(2), 288–294.

    Article  Google Scholar 

  • Ye, J., & Ma, H. (2015). Multi-objective joint optimization of production scheduling and maintenance planning in the flexible job-shop problem. Mathematical Problems in Engineering. doi:10.1155/2015/725460. Accessed March 12, 2016.

  • Zhang, G., Gao, L., Li, X., & Li, P. (2008). Variable neighborhood genetic algorithm for the flexible job shop scheduling problems. In C. Xiong, Y. Huang, & Y. Xiong (Eds.), Intelligent Robotics and Applications. First International Conference, ICIRA 2008 Wuhan, China (pp. 503–512). Berlin/Heidelberg: Springer.

    Google Scholar 

  • Zhang, G., Gao, L., & Shi, Y. (2010). A genetic algorithm and tabu search for multi objective flexible job shop scheduling problems. In 2010 International Conference on Computing, Control and Industrial Engineering (CCIE) (Vol. 1, pp. 251–254). Piscataway, NJ: IEEE.

    Google Scholar 

  • Zhang, C., Li, P., Guan, Z., & Rao, Y. (2007). A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research, 34(11), 3229–3242.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Systems, University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland

    Thomas Hanne

  2. Institute for Information Systems, University of Applied Sciences and Arts Northwestern Switzerland, Basel, Switzerland

    Rolf Dornberger

Authors
  1. Thomas Hanne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Dornberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hanne, T., Dornberger, R. (2017). Scheduling. In: Computational Intelligence in Logistics and Supply Chain Management. International Series in Operations Research & Management Science, vol 244. Springer, Cham. https://doi.org/10.1007/978-3-319-40722-7_5

Download citation

Publish with us

Policies and ethics

Search

Navigation