Permutation flowshop scheduling with periodic maintenance and makespan objective.
Paz Perez-GonzalezVictor Fernandez-ViagasJose M. FramiñanPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- permutation flowshop
- scheduling problem
- preventive maintenance
- total flowtime
- single machine
- flowshop
- completion times
- parallel machines
- unrelated parallel machines
- np hard
- strongly np hard
- tabu search
- processing times
- precedence constraints
- release dates
- setup times
- job shop
- maximum lateness
- minimizing makespan
- identical parallel machines
- upper bound
- scheduling jobs
- lower bound
- search algorithm
- worst case