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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498–517.
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.
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.
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.
Bürgy, R. (2017). A neighborhood for complex job shop scheduling problems with regular objectives. Journal of Scheduling, 20(4), 391–422.
Groeflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643–3655.
Oddi, A., Rasconi, R., Cesta, A., & Smith, S. F. (2012). Iterative improvement algorithms for the blocking job shop. In ICAPS.
Pranzo, M., & Pacciarelli, D. (2013). An iterated greedy metaheuristic for the blocking job shop scheduling problem. Journal of Heuristics, 1–25.
Lawrence, S. (1984). Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Pittsburgh: GSIA, Carnegie Mellon University.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Lange, J., Werner, F. (2018). A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_77
Download citation
DOI: https://doi.org/10.1007/978-3-319-89920-6_77
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89919-0
Online ISBN: 978-3-319-89920-6
eBook Packages: Business and ManagementBusiness and Management (R0)