Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

DOI10.1016/j.ejor.2004.08.037zbMath1091.90022MaRDI QIDQ2576249

Irina N. Lushchakova

Publication date: 27 December 2005

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

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

zbMATH Keywords

scheduling theory; open shop; identical parallel machines

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling three chains on two parallel machines, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

Cites Work

• A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
• Complexity results for single-machine problems with positive finish-start time-lags
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey