Reactive and proactive single-machine scheduling to maintain a maximum number of starting times

DOI10.1007/S10479-018-2763-9zbMath1467.90005OpenAlexW2793176419MaRDI QIDQ829172

Philippe Chrétienne

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-02078478/file/singlemachinemaxanchor%20%281%29.pdf

zbMATH Keywords

complexityschedulingdynamic programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures

Cites Work

• Unnamed Item
• On 2-stage robust LP with RHS uncertainty: complexity results and applications
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• The construction of stable project baseline schedules
• Incidence matrices and interval graphs

This page was built for publication: Reactive and proactive single-machine scheduling to maintain a maximum number of starting times