Energetic reasoning revisited: Application to parallel machine scheduling
From MaRDI portal
Publication:835610
DOI10.1007/s10951-008-0070-zzbMath1168.90444OpenAlexW2022820435MaRDI QIDQ835610
Lotfi Hidri, Anis Gharbi, Mohamed Haouari
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0070-z
schedulingbranch-and-boundmakespanrelease datesdue datesenergetic reasoningfeasibility and adjustment procedures
Related Items (3)
IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem ⋮ Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem ⋮ Bounding strategies for the hybrid flow shop scheduling problem
Cites Work
- Lower bounds for scheduling on identical parallel machines with heads and tails
- Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- The job-shop problem and immediate selection
- Adjustment of heads and tails for the job-shop problem
- A branch-and-bound algorithm for the resource-constrained project scheduling problem
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Optimal parallel machines scheduling with availability constraints
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
- Tight LP bounds for resource constrained project scheduling
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
- Bounds for naive multiple machine scheduling with release times and deadlines
- An Algorithm for Solving the Job-Shop Problem
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- Some simple scheduling algorithms
This page was built for publication: Energetic reasoning revisited: Application to parallel machine scheduling
