Pages that link to "Item:Q337268"

The following pages link to Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268):

Displaying 10 items.

• An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← 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)
• Bounds for parallel machine scheduling with predefined parts of jobs and setup time (Q1708539) (← links)
• Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
• (Q5125441) (← links)
• Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems (Q6130890) (← links)
• Quantum annealing to solve the unrelated parallel machine scheduling problem (Q6135480) (← links)