A Three-Agent Flow Shop Problem for Minimizing the Total Completion Time.
Wen-Chiung LeeJen-Ya WangPublished in: IIAI-AAI (2017)
Keyphrases
- completion times
- flowshop
- scheduling problem
- single machine
- processing times
- multi agent systems
- multi agent
- open shop
- single machine scheduling problem
- weighted sum
- special case
- setup times
- sequence dependent setup times
- tabu search
- job processing times
- flowshop scheduling
- lot streaming
- minimizing makespan
- asymptotic optimality
- makespan minimization
- flowshop scheduling problems
- maximum lateness
- job shop
- buffer allocation
- np hard
- release dates
- manufacturing cell
- job shop scheduling
- queue length
- np complete
- production system