Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects.
Jin Young ChoiPublished in: Comput. Ind. Eng. (2015)
Keyphrases
- completion times
- single machine
- scheduling problem
- release dates
- processing times
- weighted number of tardy jobs
- maximum lateness
- scheduling jobs
- batch processing machines
- release times
- flowshop
- identical parallel machines
- single machine scheduling problem
- parallel machine scheduling problem
- open shop
- identical machines
- unrelated parallel machines
- parallel machines
- job processing times
- weighted sum
- sequence dependent setup times
- total weighted tardiness
- deteriorating jobs
- precedence constraints
- multi agent systems
- job shop
- multi agent
- setup times
- multiagent systems
- bicriteria
- autonomous agents
- decision making
- intelligent agents
- multiple agents
- np hard
- mobile agents
- queue length
- tabu search
- job scheduling
- dynamic programming
- job shop scheduling
- minimizing makespan
- global constraints
- scheduling decisions
- batch processing
- steady state
- fixed number
- software agents
- combinatorial optimization
- branch and bound algorithm
- job shop scheduling problem