On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
From MaRDI portal
Publication:4327891
DOI10.1080/02331939208843762zbMath0817.90034OpenAlexW1999049120MaRDI QIDQ4327891
Martina Kleinau, Heidemarie Bräsel
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843762
Related Items
The representation of partially-concurrent open shop problems, Four decades of research on the open-shop scheduling problem to minimize the makespan, Constructive heuristic algorithms for the open shop problem
Cites Work