Makespan minimization on uniform parallel machines with release times

DOI10.1016/S0377-2217(03)00243-1zbMath1106.90032MaRDI QIDQ1877043

Kyparisis, George J., Christos P. Koulamas

Publication date: 16 August 2004

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

zbMATH Keywords

Analysis of algorithmsApproximations-heuristicProduction-schedulingUniform parallel machines

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (5)

Scheduling with flexible resources in parallel workcenters to minimize maximum completion time ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times ⋮ Impact of worker and shop flexibility on assembly cells

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Scheduling on uniform parallel machines to minimize maximum lateness
• Bounds for naive multiple machine scheduling with release times and deadlines
• Bounds for List Schedules on Uniform Processors

This page was built for publication: Makespan minimization on uniform parallel machines with release times