Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
Johann L. Hurink,Jens Keuchel +1 more
TLDR
In this paper a local search approach for a single-machine scheduling problem with positive and negative time-lags and the objective to minimize the makespan is presented and infeasible solutions are incorporated into the search process.About:
This article is published in Discrete Applied Mathematics.The article was published on 2001-09-15 and is currently open access. It has received 27 citations till now. The article focuses on the topics: Job shop scheduling & Single-machine scheduling.read more
Citations
More filters
Journal ArticleDOI
Timing problems and algorithms: Time decisions for sequences of activities
TL;DR: A classification of timing problems and features are introduced, as well as a unifying multidisciplinary analysis of timing algorithms, in relation to frequent application cases within branching schemes or neighborhood searches, and the efficient resolution of series of similar timing subproblems is analyzed.
Journal ArticleDOI
Generalized disjunctive constraint propagation for solving the job shop problem with time lags
TL;DR: An insertion heuristic and generalized resource constraint propagation mechanisms are proposed and the results obtained conclude that the heuristic achieves the best solutions on the instances, especially when problems involve tightened time lags.
Journal ArticleDOI
Scheduling coupled-operation jobs with exact time-lags
TL;DR: It is proved that the problem of finding an optimal sequence of second operations for a fixed sequence of first operations is NP-hard in the strong sense even in the case of unit processing times.
Journal ArticleDOI
Scatter search with path relinking for the job shop with time lags and setup times
TL;DR: This paper proposes a scatter search algorithm which uses path relinking and tabu search in its core, and proposes effective neighborhood structures with the objectives of reducing the makespan and regain feasibility.
Journal ArticleDOI
Heuristics for a coupled-operation scheduling problem
Chris N. Potts,J D Whitehead +1 more
TL;DR: Results of extensive computational tests are reported, showing that the heavy computational burden of testing potential solutions renders the local search algorithms uncompetitive in comparison to the construction algorithms.
References
More filters
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
Book
Local Search in Combinatorial Optimization
TL;DR: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time.
Journal ArticleDOI
A Fast Taboo Search Algorithm for the Job Shop Problem
TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented, based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions.