Pages that link to "Item:Q1919857"
From MaRDI portal
The following pages link to A comparison of local search methods for flow shop scheduling (Q1919857):
Displaying 15 items.
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (Q1592285) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling (Q1603328) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A local search method for permutation flow shop scheduling (Q3433488) (← links)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling (Q4302714) (← links)
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties (Q5936755) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
- Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)
