Pages that link to "Item:Q992577"
From MaRDI portal
The following pages link to Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577):
Displaying 35 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Minimizing resource consumption on uniform parallel machines with a bound on makespan (Q336672) (← links)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
- A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Uniform parallel machine scheduling with resource consumption constraint (Q2009726) (← links)
- Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect (Q2060398) (← links)
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
- Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
- A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
- The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches (Q3304199) (← links)
- SPATIAL SCHEDULING AND WORKFORCE ASSIGNMENT PROBLEM IN BLOCK ASSEMBLY SHOP OF SHIPBUILDING (Q5411733) (← links)