Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
From MaRDI portal
(Redirected from Publication:1885337)
Recommendations
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Preemptive scheduling of equal-length jobs in polynomial time
- On polynomial solvability of two multiprocessor scheduling problems
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- scientific article; zbMATH DE number 2086932
- On the optimality of exact and approximation algorithms for scheduling problems
- Multiprocessor scheduling under precedence constraints: polyhedral results
- On a parallel machine scheduling problem with equal processing times
Cited in
(32)- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
- Scheduling problem with multi-purpose parallel machines
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- Normal-form preemption sequences for an open problem in scheduling theory
- Time-of-use scheduling problem with equal-length jobs
- Parameterized complexity of machine scheduling: 15 open problems
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Ideal schedules in parallel machine settings
- Approximations for Throughput Maximization
- A decomposition scheme for single stage scheduling problems
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Parallel machine problems with equal processing times: a survey
- Equitable scheduling on a single machine
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- On a parallel machine scheduling problem with equal processing times
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- scientific article; zbMATH DE number 7765369 (Why is no real title available?)
- Integer preemptive scheduling on parallel machines
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
- Integrality Property in Preemptive Parallel Machine Scheduling
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A new polynomial algorithm for a parallel identical scheduling problem
- The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints
- Scheduling jobs with release dates on parallel batch processing machines
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- Scheduling equal length jobs with eligibility restrictions
This page was built for publication: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885337)
