Improving local search heuristics for some scheduling problems. II

DOI10.1016/S0166-218X(96)00036-4zbMath0872.90045WikidataQ57633980 ScholiaQ57633980MaRDI QIDQ5961605

Johann L. Hurink, Peter Brucker, Frank Werner

Publication date: 21 April 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

schedulingsimulated annealingsequencingprecedence constraintslocal search techniques

Mathematics Subject Classification ID

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

Related Items

Exponential size neighborhoods for makespan minimization scheduling, Bounds for the Convergence Time of Local Search in Scheduling Problems, Local search for multiprocessor scheduling: how many moves does it take to a local optimum?, Performance guarantees of jump neighborhoods on restricted related parallel machines, Quality of move-optimal schedules for minimizing total weighted completion time, An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem, Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines, Local search heuristics for two-stage flow shop problems with secondary criterion, Deterministic job-shop scheduling: Past, present and future, Structure and complexity of extreme Nash equilibria, 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, Performance guarantees of local search for minsum scheduling problems

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Large-step Markov chains for the TSP incorporating local search heuristics
• The complexity of one-machine batching problems
• Improving local search heuristics for some scheduling problems. I
• Optimal two- and three-stage production schedules with setup times included
• Sequencing to Minimize the Maximum Job Cost
• Job Shop Scheduling by Simulated Annealing
• Complexity of Scheduling under Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Computational Study of Local Search Algorithms for Job Shop Scheduling