Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints

DOI10.1007/978-3-319-07956-1_6zbMath1445.90035OpenAlexW2104204295MaRDI QIDQ5251634

Yumei Huo

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Parallel machine makespan minimization subject to machine availability and total completion time constraints

This page was built for publication: Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints