Pages that link to "Item:Q5464436"
From MaRDI portal
The following pages link to Improved lower bounds for the early/tardy scheduling problem with no idle time (Q5464436):
Displaying 11 items.
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
- Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
- On solving the assembly line worker assignment and balancing problem via beam search (Q709148) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- Order acceptance with weighted tardiness (Q878579) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling (Q2426522) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
- A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM (Q5487850) (← links)
