An Efficient Heuristic for Scheduling a Flowshop to Minimize the Makespan Criterion.
Mohamed MaizaHamid HentousAbdenour LabedPublished in: ISCC (2006)
Keyphrases
- scheduling problem
- flowshop
- total flowtime
- unrelated parallel machines
- maximum tardiness
- minimizing makespan
- tabu search
- permutation flowshop
- number of tardy jobs
- strongly np hard
- sequence dependent setup times
- processing times
- parallel machines
- preventive maintenance
- single machine
- setup times
- single machine scheduling problem
- maximum lateness
- flowshop scheduling problems
- job shop scheduling problem
- flowshop scheduling
- precedence constraints
- minimizing total tardiness
- release dates
- job shop
- bicriteria
- total tardiness
- makespan minimization
- np hard
- identical parallel machines
- special case
- search algorithm
- total weighted tardiness
- optimal solution
- feasible solution
- metaheuristic
- memetic algorithm
- dynamic programming