The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
From MaRDI portal
Publication:2286435
Recommendations
- A note on the complexity of the problem of two-agent scheduling on a single machine
- scientific article; zbMATH DE number 6531341
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Complexities of four problems on two-agent scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Cites work
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Competitive two-agent scheduling and its applications
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with high multiplicity
- Scheduling Problems with Two Competing Agents
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Cited in
(20)- Complexities of four problems on two-agent scheduling
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Pareto-scheduling of two competing agents with their own equal processing times
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Multitasking scheduling problems with two competitive agents
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine 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
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Single-machine scheduling of multiple projects with controllable processing times
- Two-agent scheduling of equal-length jobs on uniform parallel machines
- Two-agent scheduling with time-dependent and position-dependent in a flow-shop system
- Pareto-scheduling of two competing agents with total weighted tardiness being one criterion
- A note on multi-agent scheduling to minimize the total weighted number of tardy jobs
This page was built for publication: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286435)
