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

DOI10.1016/J.EJOR.2006.07.024MaRDI QIDQ879326zbMATH OpenOpenAlexFDO

Authors 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

schedulingsingle machineshifting bottleneck heuristicdue windowgeneralized lateness objective

Mathematics Subject Classification ID

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

Recommendations

• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• scientific article; zbMATH DE number 1271322
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The generalized shifting bottleneck procedure
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM

Cites work

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

Cited in

(1)

• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879326)