Pages that link to "Item:Q883312"
From MaRDI portal
The following pages link to Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312):
Displaying 19 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems (Q2185527) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
- Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
