General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach.
Nhat Vinh VoPauline FouilletChristophe LentéPublished in: ICORES (2014)
Keyphrases
- scheduling problem
- flowshop
- special case
- lower bound
- np hard
- minimizing makespan
- single machine
- completion times
- setup times
- strongly np hard
- processing times
- maximum lateness
- minimizing total tardiness
- bicriteria
- flowshop scheduling
- tabu search
- total flowtime
- total tardiness
- sequence dependent setup times
- upper bound
- precedence constraints
- total weighted tardiness
- job processing times
- polynomially solvable
- maximum tardiness
- preventive maintenance
- permutation flowshop
- unrelated parallel machines
- parallel machines
- flowshop scheduling problems
- makespan minimization
- worst case
- competitive ratio
- np complete
- single machine scheduling problem
- job shop scheduling problem
- branch and bound algorithm
- optimal solution
- objective function