Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
From MaRDI portal
Publication:1885337
DOI10.1007/s10288-003-0024-4zbMath1070.90041OpenAlexW1704392916MaRDI QIDQ1885337
Peter Brucker, Sigrid Knust, Philippe Baptiste, Timkovsky, Vadim G.
Publication date: 28 October 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-003-0024-4
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review, A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs, A survey of single machine scheduling to minimize weighted number of tardy jobs, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, A note on batch scheduling on a two-machine flowshop with machine-dependent processing times, Equitable scheduling on a single machine, Time-of-use scheduling problem with equal-length jobs, Integer preemptive scheduling on parallel machines, Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines, Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs, Normal-form preemption sequences for an open problem in scheduling theory, A new polynomial algorithm for a parallel identical scheduling problem, Parallel machine problems with equal processing times: a survey, Preemptive scheduling of two uniform parallel machines to minimize total tardiness, Unnamed Item, Preemptive scheduling of equal-length jobs to maximize weighted throughput., Scheduling problem with multi-purpose parallel machines, On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups, A decomposition scheme for single stage scheduling problems, The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints, Parameterized complexity of machine scheduling: 15 open problems, Ideal schedules in parallel machine settings, Scheduling equal length jobs with eligibility restrictions, A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time, Integrality Property in Preemptive Parallel Machine Scheduling, Scheduling jobs with release dates on parallel batch processing machines, Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time, On the optimality of the earliest due date rule in stochastic scheduling and in queueing, New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
