Scheduling with earliest start and due date constraints on multiple machines
From MaRDI portal
Publication:4062910
DOI10.1002/nav.3800220113zbMath0306.90032OpenAlexW1974646667MaRDI QIDQ4062910
Pierre N. Robillard, Paul Bratley, Michael Florian
Publication date: 1975
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800220113
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimal schedulability interval for real-time systems of periodic tasks with offsets, The hybrid flow shop scheduling problem, Branch and bound algorithm for the flow shop with multiple processors, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Minimizing makespan on parallel machines subject to release dates and delivery times
