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

DOI10.1007/S10479-018-2763-9zbMATH Open1467.90005OpenAlexW2793176419MaRDI QIDQ829172FDOQ829172

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

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

zbMATH Keywords

dynamic programmingcomplexityscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (5)

• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Title not available (Why is that?)
• Robust Predictive-Reactive Scheduling: An Information-Based Decision Tree Model
• 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

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)