Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
From MaRDI portal
Publication:1970336
DOI10.1023/A:1009827520712zbMath0962.90019OpenAlexW1527017525MaRDI QIDQ1970336
Martin Middendorf, Timkovsky, Vadim G.
Publication date: 19 March 2000
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009827520712
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
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 ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Job-shop scheduling in a body shop ⋮ Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
