The following pages link to (Q4882527):
Displayed 10 items.
- Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Q2475846) (← links)
- Adaptive multimeme algorithm for flexible job shop scheduling problem (Q6191213) (← links)