Pages that link to "Item:Q2276868"
From MaRDI portal
The following pages link to Heuristics for scheduling unrelated parallel machines (Q2276868):
Displaying 17 items.
- Processing time generation schemes for parallel machine scheduling problems with various correlation structures (Q490376) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)