Scheduling with deadlines and nested processing intervals for a single machine

MaRDI QIDQ2712365zbMATH OpenFDO

Authors O. A. Yanushkevich, V. S. Gordon, Frank Werner

Publication date 6 May 2001

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling with deadlines and increasing rates of processing times
• Single machine batch scheduling with deadlines and resource dependent processing times
• Preemptive scheduling with deadlines on a single machine
• Scheduling jobs on a single machine with periodic release date/deadline intervals
• Scheduling of unit processing time jobs on a single machine
• scientific article; zbMATH DE number 1187294
• Single-machine scheduling with time window-dependent processing times
• Scheduling on a single processor subject to interruptions in processing
• Single machine scheduling with deadlines, release and due dates

Cited in

(6)

• Scheduling jobs on a single machine with periodic release date/deadline intervals
• Scheduling chains on a single machine with non-negative time lags
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
• The problem of minimizing the weighted number of late jobs to meet strict deadlines and due processing times.
• Single machine scheduling with deadlines, release and due dates

This page was built for publication: Scheduling with deadlines and nested processing intervals for a single machine

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