A Job Shop Scheduling Problem with Due Dates Under Conditions of Uncertainty.
Wojciech BozejkoPawel RajbaMariusz UchronskiMieczyslaw WodeckiPublished in: ICCS (1) (2021)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- critical path
- scheduling problem
- benchmark problems
- tabu search
- memetic algorithm
- production scheduling
- genetic algorithm
- simulated annealing
- total weighted tardiness
- processing times
- graph model
- benchmark instances
- combinatorial optimization problems
- job shop
- tabu search algorithm
- single machine
- neural network
- optimization problems
- information retrieval systems
- co occurrence
- multi objective
- search algorithm