Using precedence intervals to solve constrained precedence problems

DOI10.1007/BF01078676MaRDI QIDQ3659515zbMATH OpenOpenAlexFDO

Authors A. E. Serik

Publication date 1982

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01078676

zbMATH Keywords

acyclic directed graphoptimal solutionpermutationprecedence intervalsprecedence problemssequencingstrict order binary relation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Method for optimzing functionals of permutations in the presence of constraints
• Optimal Linear Ordering
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties

Cited in

(1)

• Certain exact and approximate algorithms for solving precedence problems with constraints

This page was built for publication: Using precedence intervals to solve constrained precedence problems

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