Heuristic-Programming Solution of a Flowshop-Scheduling Problem.
Martin J. KroneKenneth SteiglitzPublished in: Oper. Res. (1974)
Keyphrases
- scheduling problem
- flowshop
- tabu search
- maximum tardiness
- minimizing makespan
- single machine
- optimal solution
- job shop scheduling problem
- strongly np hard
- np hard
- maximum lateness
- processing times
- unrelated parallel machines
- total tardiness
- flowshop scheduling
- setup times
- parallel machines
- initial solution
- bicriteria
- minimizing total tardiness
- search procedure
- special case
- precedence constraints
- sequence dependent setup times
- total flowtime
- solution quality
- permutation flowshop
- simulated annealing
- integer programming
- lagrangian relaxation
- flowshop scheduling problems
- search algorithm
- makespan minimization
- objective function
- feasible solution
- total weighted tardiness
- preventive maintenance
- heuristic methods
- dynamic programming
- search space
- variable neighborhood search
- release dates