A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
From MaRDI portal
Publication:552090
DOI10.1016/J.MCM.2010.10.022zbMath1217.90004OpenAlexW2019682901MaRDI QIDQ552090
Hua-Wei Ma, Shan-Lin Yang, Kai Li
Publication date: 21 July 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.10.022
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (2)
Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Single-machine scheduling with release times and tails
- Search tree based approaches for parallel machine scheduling
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Scheduling on uniform parallel machines to minimize maximum lateness
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
