Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem.
Svetlana A. KravchenkoPublished in: Discret. Appl. Math. (2000)
Keyphrases
- job shop scheduling problem
- number of late jobs
- scheduling problem
- completion times
- single machine
- flowshop
- release times
- job shop scheduling
- critical path
- tabu search
- processing times
- benchmark problems
- simulated annealing
- scheduling jobs
- genetic algorithm
- memetic algorithm
- sequence dependent setup times
- release dates
- np hard
- single machine scheduling problem
- combinatorial optimization problems
- precedence constraints
- parallel machines
- batch processing
- combinatorial optimization
- graph model
- weighted sum
- metaheuristic
- setup times
- particle swarm optimization
- special case