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

DOI10.1137/0123021MaRDI QIDQ5630805zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(18)

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

This page was built for publication: Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5630805)