Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity.
Mikhail Y. KovalyovDmitrij SesokPublished in: J. Sched. (2019)
Keyphrases
- deteriorating jobs
- single machine
- identical machines
- scheduling problem
- batch processing
- computational complexity
- parallel machines
- flowshop
- maximum lateness
- scheduling jobs
- processing times
- release dates
- release times
- sequence dependent setup times
- precedence constraints
- setup times
- np hard
- special case
- single machine scheduling problem
- learning effect
- completion times
- pedagogical agents
- scheduling algorithm
- lower bound