Minimizing makespan for two parallel machines with job limit on each availability interval
From MaRDI portal
Publication:5428993
DOI10.1057/PALGRAVE.JORS.2602209zbMATH Open1178.90156OpenAlexW2009115040MaRDI QIDQ5428993FDOQ5428993
Authors:
Publication date: 29 November 2007
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602209
Recommendations
- Makespan minimization for two parallel machines with an availability constraint
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Scheduling two parallel machines with machine-dependent availabilities
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cited In (9)
- Production, maintenance and resource scheduling: a review
- Minimizing the makespan on two identical parallel machines with mold constraints
- Scheduling with cardinality dependent unavailability periods
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Scheduling two parallel machines with machine-dependent availabilities
- Makespan minimization for two parallel machines with an availability constraint
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
This page was built for publication: Minimizing makespan for two parallel machines with job limit on each availability interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428993)