Pages that link to "Item:Q2488909"
From MaRDI portal
The following pages link to A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909):
Displaying 20 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)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- Job shop scheduling with beam search (Q1806850) (← links)
- A meta-heuristic to solve the just-in-time job-shop scheduling problem (Q2028835) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← 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 survey on scheduling problems with due windows (Q2630089) (← links)
- A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129) (← links)
- Multicriteria models for just-in-time scheduling (Q2997893) (← links)
- An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal (Q3163160) (← links)
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749) (← links)
