Preemptive scheduling with deadlines on a single machine

MaRDI QIDQ4901317zbMATH OpenFDO

Authors Xueling Zhong, G. Wang, Mingbao Cheng

Publication date 24 January 2013

zbMATH Keywords

deadlineidle timerelease timesingle machine schedulingtotal earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive scheduling with deadlines on parallel machines
• Single machine scheduling with deadlines, release and due dates
• Preemptive scheduling on identical parallel machines subject to deadlines.
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints

Cited in

(8)

• A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
• scientific article; zbMATH DE number 1594558 (Why is no real title available?)
• Preemptive scheduling with deadlines on parallel machines
• Single-machine scheduling with job can be processed in advance
• Single machine scheduling with deadlines, release and due dates
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• Preemption in single machine earliness/tardiness scheduling
• Jackson's semi-preemptive scheduling on a single machine

This page was built for publication: Preemptive scheduling with deadlines on a single machine

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