Advertisement

A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization

  • Julia LangeEmail author
  • Frank Werner
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

The consideration of blocking constraints refers to the absence of buffers in a production system. A job-shop scheduling problem with a total tardiness objective is NP-hard even without blocking constraints and mathematical programming results indicate the necessity of heuristics. The neighborhood is one of its main components. In contrast to classical job-shop scheduling, a permutation of operations does not necessarily define a feasible schedule. A neighbor is determined by an adjacent pairwise interchange (API) of two operations on a machine and the resulting permutation of operations is modified to regain feasibility while maintaining the given API. The neighborhood is implemented in a simulated annealing and tested on train-scheduling-inspired problems as well as benchmark instances. The heuristic method obtains optimal and near-optimal solutions for small instances and outperforms a given MIP formulation for some of the larger ones.

Keywords

Job-shop scheduling Blocking Simulated annealing 

References

  1. 1.
    Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498–517.CrossRefGoogle Scholar
  2. 2.
    D’Ariano, A., Pacciarelli, D., & Pranzo, M. (2007). A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183(2), 643–657.CrossRefGoogle Scholar
  3. 3.
    Liu, S. Q., & Kozan, E. (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers and Operations Research, 36(10), 2840–2852.CrossRefGoogle Scholar
  4. 4.
    Lange, J., & Werner, F. (2017). Approaches to modeling train scheduling problems as job-shop problems with blocking constraints. Journal of Scheduling.  https://doi.org/10.1007/s10951-017-0526-0.
  5. 5.
    Bürgy, R. (2017). A neighborhood for complex job shop scheduling problems with regular objectives. Journal of Scheduling, 20(4), 391–422.CrossRefGoogle Scholar
  6. 6.
    Groeflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643–3655.CrossRefGoogle Scholar
  7. 7.
    Oddi, A., Rasconi, R., Cesta, A., & Smith, S. F. (2012). Iterative improvement algorithms for the blocking job shop. In ICAPS.Google Scholar
  8. 8.
    Pranzo, M., & Pacciarelli, D. (2013). An iterated greedy metaheuristic for the blocking job shop scheduling problem. Journal of Heuristics, 1–25.Google Scholar
  9. 9.
    Lawrence, S. (1984). Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Pittsburgh: GSIA, Carnegie Mellon University.Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Otto-von-Guericke-Universität MagdeburgMagdeburgGermany

Personalised recommendations