Pages that link to "Item:Q342431"

The following pages link to A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431):

Displaying 8 items.

• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem (Q2120134) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
• Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)