Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties

DOI10.1137/0123021zbMath0224.90025OpenAlexW2049994136MaRDI QIDQ5630805

W. A. Horn

Publication date: 1972

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0123021

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

A note on order preserving matchings ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Ranking the vertices of a complete multipartite paired comparison digraph ⋮ Sequencing with general precedence constraints ⋮ Task scheduling with precedence constraints to minimize the total completion time ⋮ LAD models, trees, and an analog of the fundamental theorem of arithmetic ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Linear placement algorithms and applications to VLSI design ⋮ Precedence constrained scheduling to minimize sum of weighted completion times on a single machine ⋮ Lower bounds and algorithms for flowtime minimization on a single machine with set-up times ⋮ Stochastic scheduling in an in-forest ⋮ Single-machine scheduling with supporting tasks ⋮ Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints ⋮ On batch scheduling of jobs with stochastic service times and cost structures on a single server ⋮ A branch and bound algorithm for the minimum storage-time sequencing problem ⋮ Effective solution of certain problems of theory of schedulings of nets ⋮ Using precedence intervals to solve constrained precedence problems