On the set of solutions of the open shop problem

DOI10.1023/A:1018938915709zbMath0958.90035OpenAlexW30767601MaRDI QIDQ1960322

Per Willenius, Heidemarie Bräsel, Thomas Tautenhahn, Martin Harborth

Publication date: 11 January 2000

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018938915709

zbMATH Keywords

open shopenumerational resultsirreducible sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

Mean flow time minimization with given bounds of processing times ⋮ The representation of partially-concurrent open shop problems ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

This page was built for publication: On the set of solutions of the open shop problem