Makespan minimization for parallel machines scheduling with multiple availability constraints

DOI10.1007/s10479-012-1059-8zbMath1296.90048OpenAlexW2005299742MaRDI QIDQ744645

Béla Vizvári, Claver Diallo, Navid Hashemian

Publication date: 26 September 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1059-8

zbMATH Keywords

schedulingparallel machinesmakespanavailability constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints ⋮ Multitasking via alternate and shared processing: algorithms and complexity ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs ⋮ Two parallel machines problem with job delivery coordination and availability constraint ⋮ Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
• Current trends in deterministic scheduling
• Scheduling preemptable tasks on parallel processors with limited availability
• Makespan minimization for two parallel machines with an availability constraint
• Scheduling with limited machine availability
• Parallel machine scheduling with machine availability and eligibility constraints
• Machine scheduling with an availability constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Makespan minimization for parallel machines scheduling with multiple availability constraints