A linear programming based heuristic for solving a two-stage flowshop scheduling problem.
Ewa FigielskaPublished in: ETFA (2007)
Keyphrases
- scheduling problem
- flowshop
- linear programming
- strongly np hard
- maximum tardiness
- np hard
- tabu search
- minimizing makespan
- optimal solution
- processing times
- job shop scheduling problem
- lp relaxation
- feasible solution
- single machine
- unrelated parallel machines
- setup times
- permutation flowshop
- dynamic programming
- flowshop scheduling
- special case
- sequence dependent setup times
- combinatorial optimization
- total tardiness
- linear program
- bicriteria
- lagrangian relaxation
- total flowtime
- minimizing total tardiness
- parallel machines
- precedence constraints
- total weighted tardiness
- maximum lateness
- makespan minimization
- preventive maintenance
- simulated annealing
- column generation
- integer programming
- identical parallel machines
- flowshop scheduling problems
- branch and bound algorithm
- metaheuristic
- np complete
- genetic algorithm
- search algorithm
- knapsack problem
- solution quality
- release dates