Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates.
Wen-Chiung LeeChin-Chia WuYu-Hsiang ChungHan-Chu LiuPublished in: Comput. Oper. Res. (2009)
Keyphrases
- flowshop
- completion times
- scheduling problem
- processing times
- absolute deviation
- special case
- bicriteria
- job processing times
- asymptotic optimality
- flowshop scheduling
- setup times
- single machine
- sequence dependent setup times
- maximum lateness
- open shop
- tabu search
- single machine scheduling problem
- makespan minimization
- minimizing makespan
- lot streaming
- strongly np hard
- robotic cell
- unrelated parallel machines
- shortest processing time
- total weighted tardiness
- weighted sum
- job shop
- np hard
- scheduling jobs
- neural network
- release dates
- cost function
- job shop scheduling