Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP.
Giulia FrancescuttoKonstantin SchekotihinMohammed M. S. El-KholanyPublished in: CoRR (2021)
Keyphrases
- job shop scheduling problem
- partial ordering
- job shop scheduling
- combinatorial optimization
- critical path
- total ordering
- tabu search
- combinatorial optimization problems
- simulated annealing
- benchmark problems
- scheduling problem
- production scheduling
- partial order
- genetic algorithm
- memetic algorithm
- partially ordered
- graph model
- fixed number
- metaheuristic
- optimization problems
- artificial neural networks
- resource constraints
- knapsack problem
- ant colony optimization
- np complete
- evolutionary algorithm
- lower bound
- search algorithm