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

A heuristic approach to allocating the c

A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan

✍ Joanna Józefowska; Marek Mika; Rafał Różycki; Grzegorz Waligóra; Jan Węglarz 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 98 KB

A problem of scheduling jobs on parallel, identical machines under an additional continuous resource to minimize the makespan is considered. Jobs are non-preemtable and independent and all are available at the start of the process. The total amount of the continuous resource available at a time is l