Complexities of some problems on multi-agent scheduling on a single machine
From MaRDI portal
Publication:2014052
Recommendations
Cites work
Cited in
(15)- A note on a two-agent scheduling problem related to the total weighted late work
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Single-machine multi-agent scheduling problems with a global objective function
- Two-agent single-machine scheduling with cumulative deterioration
- scientific article; zbMATH DE number 6672372 (Why is no real title available?)
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
This page was built for publication: Complexities of some problems on multi-agent scheduling on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014052)