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

DOI10.1016/J.EJOR.2004.08.037MaRDI QIDQ2576249zbMATH OpenOpenAlexFDO

Authors I. 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

open shopidentical parallel machinesscheduling theory

Mathematics Subject Classification ID

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

Recommendations

• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Preemptive scheduling on uniform machines to minimize mean flow time
• scientific article; zbMATH DE number 3883931
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness

Cites work

• A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Complexity results for single-machine problems with positive finish-start time-lags
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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

Cited in

(12)

• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Ideal schedules in parallel machine settings
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
• The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
• Scheduling three chains on two parallel machines
• Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

This page was built for publication: Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576249)