scientific article; zbMATH DE number 613300

MaRDI QIDQ4300481zbMATH OpenFDO

Authors Jun Ma, Shaohan Ma

Publication date 31 January 1995

zbMATH Keywords

approximate algorithmmaximum flowNP-complete problemtime-limited scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An algorithm for the job schedule problem on the model of the common resources captured in short time
• Approximation algorithms for time constrained scheduling
• scientific article; zbMATH DE number 4093160
• Scheduling jobs with fixed start and end times
• scientific article; zbMATH DE number 4170628

Cited in

(5)

• Two-stage no-wait scheduling models with setup and removal times separated
• An algorithm for the job schedule problem on the model of the common resources captured in short time
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• scientific article; zbMATH DE number 6796346 (Why is no real title available?)
• Approximation algorithms for time constrained scheduling

This page was built for publication:

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