Preemptive Scheduling with Due Dates

DOI10.1287/OPRE.27.5.925MaRDI QIDQ3859548zbMATH OpenOpenAlexFDO

Authors Sartaj Sahni

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.5.925

zbMATH Keywords

computational complexitydue daterelease datepreemptive schedulingn jobson linem identical parallel machinesnearly on lineoff linepolynomial- bounded algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(22)

• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime
• Scheduling electric vehicle regular charging tasks: a review of deterministic models
• Scheduling on semi-identical processors
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• A state-of-the-art review of parallel-machine scheduling research
• The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
• Nearly on line scheduling of preemptive independent tasks
• Stochastic scheduling to minimize expected maximum lateness
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Shop scheduling problems with pliable jobs
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
• Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
• The battery switching station scheduling problem
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
• The selection and scheduling of textile orders with due dates
• Multicriteria scheduling
• A PC-based production scheduling system using a mixed integer programming approach
• Scheduling Models: Shibboleth and Operating Characteristics

This page was built for publication: Preemptive Scheduling with Due Dates

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