Single-machine multi-agent scheduling problems with a global objective function.
Nguyen Huynh TuongAmeur SoukhalJean-Charles BillautPublished in: J. Sched. (2012)
Keyphrases
- single machine
- scheduling problem
- multi agent
- objective function
- processing times
- earliness tardiness
- maximum lateness
- total weighted tardiness
- release dates
- total tardiness
- minimize total
- np hard
- flowshop
- release times
- sequence dependent setup times
- weighted tardiness
- learning effect
- precedence constraints
- setup times
- scheduling jobs
- tabu search
- rolling horizon
- reinforcement learning
- job shop scheduling
- optimal solution
- feasible solution
- makespan minimization
- production scheduling
- competitive ratio
- single machine scheduling problem
- job shop scheduling problem
- parallel machines
- lower bound
- job shop
- weighted number of tardy jobs
- number of late jobs
- identical machines
- linear programming
- minimizing makespan
- optimization problems
- np complete