A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
From MaRDI portal
Publication:1404273
DOI10.1023/A:1024012811536zbMath1027.90027OpenAlexW1593079490MaRDI QIDQ1404273
Philippe Baptiste, Baruch Schieber
Publication date: 21 August 2003
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024012811536
Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (6)
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Finding total unimodularity in optimization problems solved by linear programs ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES ⋮ Scheduling multiprocessor UET tasks of two sizes ⋮ Scheduling multiprocessor tasks on two parallel processors
This page was built for publication: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
