On the representation of the one machine sequencing problem in the shifting bottleneck heuristic

DOI10.1016/J.EJOR.2006.07.024zbMath1128.90030OpenAlexW2039874357MaRDI QIDQ879326

N. E. Zubov

Publication date: 11 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://web.iima.ac.in/assets/snippets/workingpaperpdf/2004-11-01saralm.pdf

zbMATH Keywords

schedulingdue windowsingle machineshifting bottleneck heuristicgeneralized lateness objective

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• The one-machine sequencing problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Common due window size and location determination in a single machine scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A modified shifting bottleneck procedure for job-shop scheduling
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Single-machine scheduling with a common due window

This page was built for publication: On the representation of the one machine sequencing problem in the shifting bottleneck heuristic