The following pages link to (Q4508364):
Displaying 12 items.
- A multi-objective production scheduling case study solved by simulated annealing (Q863984) (← links)
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry (Q1639306) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- A genetic algorithm for the flexible job-shop scheduling problem (Q2482369) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- Approximation Algorithms for Fixed Job Schedule Problems (Q3990569) (← links)
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling (Q4706348) (← links)
- A fine-grained parallel algorithm for the cyclic flexible job shop problem (Q4971705) (← links)
- A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
- An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints (Q6092532) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)