Local search algorithms for a single-machine scheduling problem with positive and negative time-lags

DOI10.1016/S0166-218X(00)00315-2zbMath1010.90023WikidataQ126583270 ScholiaQ126583270MaRDI QIDQ5946822

Jens Keuchel, Johann L. Hurink

Publication date: 30 July 2002

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

zbMATH Keywords

scheduling; tabu search; single-machine scheduling problem; time-lags; Zbk 0693.90047

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A block approach for single-machine scheduling with release dates and due dates
• The one-machine sequencing problem
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• A branch and bound algorithm for the job-shop scheduling problem
• Heuristics for scheduling resource-constrained projects in MPM networks
• One-machine generalized precedence constrained scheduling problems
• A branch \(\&\) bound algorithm for the open-shop problem
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling