Pages that link to "Item:Q3157751"
From MaRDI portal
The following pages link to An effective heuristic for minimising makespan on unrelated parallel machines (Q3157751):
Displaying 11 items.
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
- An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886) (← links)
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
- Dispatching problems for parallel machines in the TFT‐LCD assembly process (Q6092611) (← links)