Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations.
Yuri N. SotskovNatalja M. MatsveichukVadzim D. HatsuraPublished in: Algorithms (2020)
Keyphrases
- job shop scheduling problem
- flowshop
- scheduling problem
- job shop
- job shop scheduling
- tabu search
- makespan minimization
- batch processing
- production scheduling
- total weighted tardiness
- critical path
- sequence dependent setup times
- genetic algorithm
- processing times
- setup times
- single machine
- simulated annealing
- benchmark problems
- memetic algorithm
- parallel machines
- benchmark instances
- np hard
- combinatorial optimization problems
- precedence constraints
- graph model
- tabu search algorithm
- decision making
- combinatorial optimization
- search algorithm
- neural network
- fuzzy logic
- metaheuristic
- release dates
- evolutionary algorithm
- computational complexity