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

DOI10.1007/S10479-018-2763-9MaRDI QIDQ829172zbMATH OpenOpenAlexFDO

Authors 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

complexitydynamic programmingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
• Predictive-reactive scheduling on a single resource with uncertain future jobs
• Proactive-reactive project scheduling trade-offs and procedures
• scientific article; zbMATH DE number 2221464
• The proactive and reactive resource-constrained project scheduling problem

Cites work

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

Cited in

(5)

• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
• Predictive-reactive scheduling on a single resource with uncertain future jobs
• scientific article; zbMATH DE number 2221464 (Why is no real title available?)
• Robust Predictive-Reactive Scheduling: An Information-Based Decision Tree Model

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

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