Preemptive Scheduling with Due Dates
From MaRDI portal
Publication:3859548
DOI10.1287/opre.27.5.925zbMath0424.90031OpenAlexW2126734353MaRDI QIDQ3859548
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
computational complexitydue datepreemptive schedulingrelease daten jobson linem identical parallel machinesnearly on lineoff linepolynomial- bounded algorithm
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Nearly on line scheduling of preemptive independent tasks, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, The battery switching station scheduling problem, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube, Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines, A state-of-the-art review of parallel-machine scheduling research, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Preemptive multiprocessor order scheduling to minimize total weighted flowtime, Stochastic scheduling to minimize expected maximum lateness, A PC-based production scheduling system using a mixed integer programming approach, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Scheduling on semi-identical processors, The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem, Shop scheduling problems with pliable jobs, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, The selection and scheduling of textile orders with due dates, Multicriteria scheduling, Scheduling Models: Shibboleth and Operating Characteristics
