Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming

zbMATH Open1135.90366MaRDI QIDQ3499347FDOQ3499347

Authors: Dávid Hanák, Nagarajan Kandasamy 

Publication date: 29 May 2008

Recommendations

• Scheduling with timed automata
• Scheduling Precedence Task Graphs with Disturbances
• Recoverable Robust Timetables on Trees
• Robust scheduling of metaprograms
• Evaluation of recoverable-robust timetables on tree networks

zbMATH Keywords

robustnessinteger linear programmingschedulingslackresource failure

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming

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