An alternative framework to Lagrangian relaxation approach for job shop scheduling.
From MaRDI portal
Publication:1399595
DOI10.1016/S0377-2217(02)00470-8zbMATH Open1033.90036MaRDI QIDQ1399595FDOQ1399595
Authors: Haoxun Chen, Peter B. Luh 
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Cites Work
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Survey of Scheduling Rules
- Title not available (Why is that?)
- Scheduling with limited machine availability
- Applying tabu search to the job-shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Surrogate gradient algorithm for Lagrangian relaxation
- An Algorithm for Solving the Job-Shop Problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
Cited In (27)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea
- Title not available (Why is that?)
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex
- Implementation of scheduling algorithm for optimisation by Lagrangian decomposition model
- Extending the single machine-based relaxation scheme for the job shop scheduling problem
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
- Scheduling a hybrid flowshop with batch production at the last stage
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation
- A time-indexed LP-based approach for min-sum job-shop problems
- Study of job shop scheduling problem
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
- Double layer ACO algorithm for the multi-objective FJSSP
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- The job shop scheduling problem with convex costs
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- Lagrangian bounds for just-in-time job-shop scheduling
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
This page was built for publication: An alternative framework to Lagrangian relaxation approach for job shop scheduling.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399595)
