Improving local search heuristics for some scheduling problems. I

DOI10.1016/0166-218X(95)00030-UzbMath0846.90046OpenAlexW4212808824WikidataQ57633994 ScholiaQ57633994MaRDI QIDQ1917263

Peter Brucker, Frank Werner, Johann L. Hurink

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00030-u

zbMATH Keywords

local search techniquesNP-hard scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

MPILS: an automatic tuner for MILP solvers, An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem, Improving local search heuristics for some scheduling problems. II, Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem, Deterministic job-shop scheduling: Past, present and future, Tight bounds for the identical parallel machine scheduling problem, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Cites Work

• Unnamed Item
• Unnamed Item
• Tabu search techniques. A tutorial and an application to neural networks
• Large-step Markov chains for the TSP incorporating local search heuristics
• Minimizing Total Tardiness on One Machine is NP-Hard
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• Minimizing Total Costs in One-Machine Scheduling
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• A Computational Study of Local Search Algorithms for Job Shop Scheduling