Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
From MaRDI portal
Publication:5471126
DOI10.1002/nav.20133zbMath1122.90042MaRDI QIDQ5471126
Publication date: 6 June 2006
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20133
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Four decades of research on the open-shop scheduling problem to minimize the makespan, A survey of scheduling with controllable processing times, A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
Cites Work