Pages that link to "Item:Q1399595"
From MaRDI portal
The following pages link to An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595):
Displayed 19 items.
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← links)
- A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex (Q884075) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- A Benders decomposition approach for solving the offshore wind farm installation planning at the North Sea (Q1751693) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs (Q2115759) (← links)
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach (Q2281738) (← links)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem (Q2378080) (← links)
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm (Q2397581) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) (← links)
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation (Q6110962) (← links)