Two-agent scheduling on mixed batch machines to minimise the total weighted makespan.
Guo-qiang FanJun-Qiang WangZhixin LiuPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- completion times
- flowshop
- scheduling problem
- batch processing
- job processing times
- processing times
- single machine
- parallel machines
- wafer fabrication
- identical machines
- release times
- scheduling jobs
- release dates
- identical parallel machines
- unrelated parallel machines
- open shop
- multi agent systems
- single machine scheduling problem
- multi agent
- parallel machine scheduling problem
- multiagent systems
- maximum lateness
- setup times
- sequence dependent setup times
- decision making
- bicriteria
- precedence constraints
- agent model
- weighted sum
- intelligent agents
- mobile agents
- np hard
- autonomous agents
- software agents
- minimizing makespan
- agent architecture
- job shop scheduling
- queue length
- tabu search
- special case
- dynamic environments
- scheduling algorithm
- strongly np hard
- agent technology
- competitive ratio
- pedagogical agents
- multiple agents
- distributed systems
- branch and bound algorithm
- scheduling decisions
- production system
- deteriorating jobs
- lot streaming