Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost.
Yuan GaoJinjiang YuanC. T. NgT. C. E. ChengPublished in: 4OR (2022)
Keyphrases
- identical machines
- batch processing
- parallel machines
- processing times
- wafer fabrication
- batch size
- scheduling problem
- single machine
- job processing times
- scheduling decisions
- unrelated parallel machines
- scheduling jobs
- release dates
- job scheduling
- flowshop
- maximum lateness
- batch processing machines
- multi objective
- multi agent systems
- multiagent systems
- parallel machine scheduling problem
- multi agent
- dispatching rule
- precedence constraints
- shared memory
- intelligent agents
- scheduling algorithm
- sequence dependent setup times
- production scheduling
- minimize total
- identical parallel machines
- polynomial time approximation
- special case
- completion times
- genetic algorithm
- setup times
- approximation algorithms
- tabu search
- mobile agents
- precedence relations
- optimal scheduling
- total cost
- expected cost
- lower bound
- single machine scheduling problem