An alternative framework to Lagrangian relaxation approach for job shop scheduling.

DOI10.1016/S0377-2217(02)00470-8zbMath1033.90036MaRDI QIDQ1399595

Haoxun Chen, Peter B. Luh

Publication date: 30 July 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationmanufacturing systemsSchedulingjob shops

Mathematics Subject Classification ID

Related Items (19)

A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process ⋮ A hybrid heuristic to solve the parallel machines job-shop scheduling problem ⋮ Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm ⋮ Scheduling a hybrid flowshop with batch production at the last stage ⋮ A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex ⋮ An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents ⋮ Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation ⋮ Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ Lagrangian bounds for just-in-time job-shop scheduling ⋮ A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea ⋮ The job shop scheduling problem with convex costs ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time ⋮ Train timetabling for an urban rail transit line using a Lagrangian relaxation approach ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs

Cites Work

• Unnamed Item
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Surrogate gradient algorithm for Lagrangian relaxation
• Scheduling with limited machine availability
• Applying tabu search to the job-shop scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• A Survey of Scheduling Rules
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Solving Parallel Machine Scheduling Problems by Column Generation

This page was built for publication: An alternative framework to Lagrangian relaxation approach for job shop scheduling.