Pages that link to "Item:Q1826491"

The following pages link to Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems (Q1826491):

Displaying 19 items.

• A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
• Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
• Discrete-time, economic lot scheduling problem on multiple, non-identical production lines (Q421620) (← links)
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• A beam search approach for the optimization version of the car sequencing problem (Q940889) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• 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)
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
• Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling (Q2426522) (← links)
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches (Q3055267) (← links)
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)