The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures.
Anis GharbiMohamed LabidiMohamed-Aly LoulyPublished in: J. Appl. Math. (2014)
Keyphrases
- flowshop
- scheduling problem
- processing times
- minimizing makespan
- single machine
- setup times
- bicriteria
- minimizing total tardiness
- tabu search
- total tardiness
- sequence dependent setup times
- flowshop scheduling
- special case
- makespan minimization
- maximum lateness
- precedence constraints
- total flowtime
- permutation flowshop
- parallel machines
- np hard
- preventive maintenance
- upper bound
- total weighted tardiness
- strongly np hard
- maximum tardiness
- job shop
- flowshop scheduling problems
- neural network
- unrelated parallel machines
- job shop scheduling problem