Scheduling a two-stage flowshop under makespan constraint.
Milind DawandeSrinagesh GavirneniRam RachamaduguPublished in: Math. Comput. Model. (2006)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- maximum lateness
- processing times
- unrelated parallel machines
- setup times
- single machine
- minimizing makespan
- parallel machines
- job processing times
- precedence constraints
- release dates
- number of tardy jobs
- preventive maintenance
- np hard
- job shop
- permutation flowshop
- bicriteria
- total tardiness
- total flowtime
- minimizing total tardiness
- flowshop scheduling
- tabu search
- identical parallel machines
- maximum tardiness
- special case
- batch processing machines
- strongly np hard
- total weighted tardiness
- makespan minimization
- open shop
- lot streaming
- completion times
- flowshop scheduling problems
- job shop scheduling problem
- computational complexity