The flow shop with parallel machines: A tabu search approach.
Eugeniusz NowickiCzeslaw SmutnickiPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- tabu search
- parallel machines
- flowshop
- scheduling problem
- total tardiness
- metaheuristic
- unrelated parallel machines
- makespan minimization
- setup times
- sequence dependent setup times
- maximum lateness
- simulated annealing
- feasible solution
- processing times
- precedence constraints
- memetic algorithm
- job shop scheduling problem
- search procedure
- single machine
- hybrid algorithm
- weighted tardiness
- minimize total
- np hard
- genetic algorithm
- release dates
- vehicle routing problem
- search algorithm
- job shop scheduling
- initial solution
- open shop
- single server
- job shop
- scheduling jobs
- completion times
- upper bound
- objective function