Minimizing makespan for two parallel machines with job limit on each availability interval

DOI10.1057/PALGRAVE.JORS.2602209zbMath1178.90156OpenAlexW2009115040MaRDI QIDQ5428993

No author found.

Publication date: 29 November 2007

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602209

zbMATH Keywords

schedulingparallel machinesmakespanbranch and bound methodavailability constraint

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates ⋮ Production, maintenance and resource scheduling: a review

This page was built for publication: Minimizing makespan for two parallel machines with job limit on each availability interval