Scheduling three chains on two parallel machines

DOI10.1016/j.ejor.2009.07.001zbMath1176.90191OpenAlexW1967183464MaRDI QIDQ1040986

Andrea Pacifici, Marta Flamini, Alessandro Agnetis, Gaia Nicosia

Publication date: 27 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.001

zbMATH Keywords

computational complexityschedulingparallel machinesapproximation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Parallel dedicated machines scheduling with chain precedence constraints ⋮ A job-shop problem with one additional resource type ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints ⋮ Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

Cites Work

• Unnamed Item
• Heuristics for unrelated machine scheduling with precedence constraints
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• On the complexity of non-preemptive shop scheduling with two jobs
• Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Complexity of Scheduling under Precedence Constraints
• Parallel Processing and Applied Mathematics

This page was built for publication: Scheduling three chains on two parallel machines