Single-Machine Scheduling Problems with Two Agents Competing for Makespan.
Guosheng DingShijie SunPublished in: LSMS/ICSEE (1) (2010)
Keyphrases
- single machine scheduling problem
- release dates
- processing times
- single machine
- deteriorating jobs
- scheduling problem
- release times
- precedence constraints
- branch and bound algorithm
- completion times
- combinatorial optimization
- scheduling jobs
- np hard
- lower bound
- optimal solution
- ant colony optimization
- flowshop
- lagrangian relaxation