Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
DOI10.1016/J.EJOR.2004.08.037zbMATH Open1091.90022OpenAlexW2016562180MaRDI QIDQ2576249FDOQ2576249
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
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
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
- 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
- Open shop problems with unit time operations
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
Cited In (12)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- Ideal schedules in parallel machine settings
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- Scheduling three chains on two parallel machines
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
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)
