The following pages link to (Q4239710):
Displayed 9 items.
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- A continuous approach to considering uncertainty in facility design (Q2581616) (← links)
- Flexible job-shop scheduling problem under resource constraints (Q5478847) (← links)