Heuristics for a coupled-operation scheduling problem
From MaRDI portal
Publication:3512387
DOI10.1057/palgrave.jors.2602272zbMath1177.90179OpenAlexW2084375563MaRDI QIDQ3512387
J. D. Whitehead, Chris N. Potts
Publication date: 11 July 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602272
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
The coupled unit-time operations problem on identical parallel machines with respect to the makespan ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Scheduling of coupled tasks with unit processing times ⋮ Two-machine interval shop scheduling with time lags ⋮ A branch-and-bound algorithm for the coupled task problem ⋮ Dynamic supply chain scheduling ⋮ Scheduling of coupled tasks and one-machine no-wait robotic cells ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ Coupled task scheduling with exact delays: literature review and models
This page was built for publication: Heuristics for a coupled-operation scheduling problem
