Pages that link to "Item:Q4656749"

The following pages link to A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749):

Displayed 19 items.

• Practical solutions for a dock assignment problem with trailer transportation (Q319870) ‎ (← links)
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) ‎ (← links)
• A hybrid heuristic approach for single machine scheduling with release times (Q336949) ‎ (← links)
• A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) ‎ (← links)
• Extended beam search for non-exhaustive state space analysis (Q652163) ‎ (← links)
• Search tree based approaches for parallel machine scheduling (Q941538) ‎ (← links)
• A filter-and-fan approach to the job shop scheduling problem (Q958547) ‎ (← links)
• Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) ‎ (← links)
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) ‎ (← 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)
• Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times (Q2102999) ‎ (← links)
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) ‎ (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) ‎ (← 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)
• Hybrid Metaheuristics: An Introduction (Q2950517) ‎ (← links)
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) ‎ (← links)
• Survey on Directed Model Checking (Q3614878) ‎ (← links)