Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

DOI10.1002/nav.20133zbMath1122.90042OpenAlexW1975363112MaRDI QIDQ5471126

Dvir Shabtay, Moshe Kaspi

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

zbMATH Keywords

optimizationschedulingresource allocationopen-shopequivalent load method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A survey of scheduling with controllable processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Cites Work

• Open Shop Scheduling to Minimize Finish Time
• Preemptive Scheduling of Uniform Processor Systems
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

This page was built for publication: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function