Minimizing completion time for a class of scheduling problems

DOI10.1016/0020-0190(84)90124-8zbMath0539.68025OpenAlexW2008585813MaRDI QIDQ794156

Ulrich Faigle, Rainer Schrader

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90124-8

zbMATH Keywords

greedy algorithmprecedence constraintsjob schedulingsetup minimization problem for N-free ordered setsweighted linear scheduling problems

Mathematics Subject Classification ID

Partial orders, general (06A06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Interval orders without odd crowns are defect optimal ⋮ The setup polyhedron of series-parallel posets ⋮ A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile ⋮ Minimizing setups in ordered sets of fixed width ⋮ Jump number problem: The role of matroids

Cites Work

• A labeling algorithm to recognize a line digraph and output its root graph
• Optimal Linear Extensions by Interchanging Chains
• Unnamed Item