Next Article in Journal
An Improved Genetic Algorithm with Adaptive Variable Neighborhood Search for FJSP
Next Article in Special Issue
Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints
Previous Article in Journal
Fingerprints Classification through Image Analysis and Machine Learning Method
Previous Article in Special Issue
A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico
Open AccessArticle

On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems

by Julia Lange 1,* and Frank Werner 2
1
Division of Information Process Engineering, FZI Forschungszentrum Informatik Karlsruhe, 76131 Karlsruhe, Germany
2
Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, D-39016 Magdeburg, Germany
*
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in the proceedings of the 9th IFAC Conference on Manufacturing Modeling, Management, and Control.
Algorithms 2019, 12(11), 242; https://doi.org/10.3390/a12110242
Received: 23 October 2019 / Revised: 8 November 2019 / Accepted: 11 November 2019 / Published: 12 November 2019
(This article belongs to the Special Issue Exact and Heuristic Scheduling Algorithms)
The job shop scheduling problem with blocking constraints and total tardiness minimization represents a challenging combinatorial optimization problem of high relevance in production planning and logistics. Since general-purpose solution approaches struggle with finding even feasible solutions, a permutation-based heuristic method is proposed here, and the applicability of basic scheduling-tailored mechanisms is discussed. The problem is tackled by a local search framework, which relies on interchange- and shift-based operators. Redundancy and feasibility issues require advanced transformation and repairing schemes. An analysis of the embedded neighborhoods shows beneficial modes of implementation on the one hand and structural difficulties caused by the blocking constraints on the other hand. The applied simulated annealing algorithm generates good solutions for a wide set of benchmark instances. The computational results especially highlight the capability of the permutation-based method in constructing feasible schedules of valuable quality for instances of critical size and support future research on hybrid solution techniques. View Full-Text
Keywords: job shop scheduling; blocking; total tardiness; permutations; repairing scheme; simulated annealing job shop scheduling; blocking; total tardiness; permutations; repairing scheme; simulated annealing
Show Figures

Figure 1

MDPI and ACS Style

Lange, J.; Werner, F. On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems. Algorithms 2019, 12, 242.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop