1381. Single-machine scheduling with cooperative agents and nondisjoint job sets
Invited abstract in session WC-12: Workforce assignment, stream Scheduling and Project Management.
Wednesday, 12:30-14:00Room: Clarendon SR 1.02
Authors (first author is the speaker)
| 1. | Johnson Phosavanh
|
| Discipline of Business Analytics, The University of Sydney | |
| 2. | Daniel Oron
|
| Business Analytics, The University of Sydney |
Abstract
We consider a new class of multi-agent scheduling problems where some jobs are allowed to be completed by more than one agent, each with a different processing time, allowing us to represent workers with different skill sets. This problem can be considered as a multi-stage optimization problem, where the assignment of jobs to agents needs to be decided, followed by the determination of an optimal schedule or vice versa. We show that this class of problems is not strictly easier or harder than the conventional competing or nondisjoint job set scenarios, and we provide an extensive analysis of problems consisting of two agents on a single machine with various scheduling criteria.
Keywords
- Scheduling
- Combinatorial Optimization
- Programming, Dynamic
Status: accepted
Back to the list of papers