A two-machine flowshop makespan scheduling problem with deteriorating jobs.
Wen-Chiung LeeChin-Chia WuChien-Chih WenYu-Hsiang ChungPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- flowshop
- deteriorating jobs
- scheduling problem
- maximum lateness
- single machine
- maximum tardiness
- minimizing makespan
- processing times
- setup times
- bicriteria
- flowshop scheduling
- sequence dependent setup times
- minimizing total tardiness
- total tardiness
- np hard
- parallel machines
- tabu search
- makespan minimization
- precedence constraints
- lot streaming
- permutation flowshop
- total weighted tardiness
- total flowtime
- strongly np hard
- unrelated parallel machines
- flowshop scheduling problems
- scheduling jobs
- preventive maintenance
- single machine scheduling problem
- release dates
- job shop scheduling problem
- special case
- lower bound
- completion times
- job processing times
- particle swarm optimization