Two-Machine Open Shops with Renewable Resources
From MaRDI portal
Publication:4363756
DOI10.1287/opre.45.4.544zbMath0887.90088OpenAlexW2116316504MaRDI QIDQ4363756
Bernd Jurisch, Wiesław X. Kubiak
Publication date: 12 November 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.4.544
Related Items
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, A branch \(\&\) bound algorithm for the open-shop problem, Scheduling problems for parallel dedicated machines under multiple resource constraints., Scheduling the two-machine open shop problem under resource constraints for setting the jobs, Four decades of research on the open-shop scheduling problem to minimize the makespan, Unit-time scheduling problems with time dependent resources, FPTAS for the two identical parallel machine problem with a single operator under the free changing mode, Extensions of coloring models for scheduling purposes, Open shop scheduling problems with conflict graphs
