Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines

DOI10.1016/j.disopt.2009.05.005zbMath1175.90180OpenAlexW2059491425MaRDI QIDQ1040089

Irina N. Lushchakova

Publication date: 23 November 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.05.005

zbMATH Keywords

schedulingpolynomial algorithmuniform machinesequal length jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs

Cites Work

• Unnamed Item
• The complexity of mean flow time scheduling problems with release times
• Minimizing mean flow time with release time constraint
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines