A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
From MaRDI portal
Publication:3102810
DOI10.1080/00207720903308389zbMath1233.90173OpenAlexW2027128158MaRDI QIDQ3102810
Publication date: 25 November 2011
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720903308389
heuristicsLagrangian relaxationdynamic programmingrelease datesdissimilar parallel machinemachine-based decomposition
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates ⋮ Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
Cites Work
- Approximation algorithms for scheduling unrelated parallel machines
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Scheduling a hybrid flowshop with batch production at the last stage
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- Scheduling identical parallel machines to minimize total weighted completion time
- An approximation algorithm for the generalized assignment problem
- A dynamic programming algorithm for single machine scheduling with ready times
- Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Forest management models and combinatorial algorithms: Analysis of state of the art
- Parallel Machine Scheduling by Column Generation
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Solving Parallel Machine Scheduling Problems by Column Generation
- The omnipresence of Lagrange
This page was built for publication: A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
