Pages that link to "Item:Q5464237"
From MaRDI portal
The following pages link to Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems (Q5464237):
Displaying 14 items.
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times (Q339586) (← links)
- A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm (Q972655) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Bi-objective optimisation model for installation scheduling in offshore wind farms (Q1652103) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times (Q1761176) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Solving real car sequencing problems with ant colony optimization (Q2503217) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)