A sequantial distributed approach for the joint scheduling of jobs and maintenance operations in the flowshop sequencing problem.
Si Larabi KhelifatiFatima Benbouzid-SitayebPublished in: ISDA (2011)
Keyphrases
- flowshop
- scheduling problem
- preventive maintenance
- maximum lateness
- sequence dependent setup times
- processing times
- single machine
- parallel machines
- unrelated parallel machines
- setup times
- flowshop scheduling
- job processing times
- precedence constraints
- total tardiness
- number of tardy jobs
- makespan minimization
- release dates
- special case
- precedence relations
- bicriteria
- job shop
- np hard
- minimizing total tardiness
- identical parallel machines
- minimizing makespan
- distributed systems
- permutation flowshop
- identical machines
- strongly np hard
- total weighted tardiness
- job shop scheduling problem
- tabu search
- total flowtime
- maximum tardiness
- dispatching rule
- dynamic programming
- flowshop scheduling problems
- upper bound