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: JELIA (2021)
Keyphrases
- job shop scheduling problem
- partial ordering
- job shop scheduling
- combinatorial optimization
- total ordering
- scheduling problem
- critical path
- partial order
- partially ordered
- production scheduling
- simulated annealing
- tabu search
- combinatorial optimization problems
- genetic algorithm
- benchmark problems
- memetic algorithm
- fixed number
- graph model
- processing times
- resource constraints
- metaheuristic
- genetic programming
- search algorithm
- neural network
- optimization problems
- evolutionary algorithm
- machine learning