Single-machine scheduling with multi-agents to minimize total weighted late work
From MaRDI portal
Publication:2197329
Recommendations
- Two-agent scheduling problems on a single-machine to minimize 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
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Two competitive agents to minimize the weighted total late work and the total completion time
Cites work
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A multiple-criterion model for machine scheduling
- A note on a two-agent scheduling problem related to the total weighted late work
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on the two machine job shop with the weighted late work criterion
- A two-agent single-machine scheduling problem with late work criteria
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Competitive two-agent scheduling and its applications
- Complexities of some problems on multi-agent scheduling on a single machine
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- 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
- Multi-agent single machine scheduling
- Multiagent scheduling. Models and algorithms
- Open shop scheduling problems with late work criteria.
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Scheduling Problems with Two Competing Agents
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single machine scheduling with two competing agents and equal job processing times
- Single-machine scheduling with deadlines to minimize the total weighted late work
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
Cited in
(29)- A two-agent single-machine scheduling problem with late work criteria
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Pareto-scheduling of two competing agents with their own equal processing times
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Two competitive agents to minimize the weighted total late work and the total completion time
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- 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
- Single-machine multi-agent scheduling problems with a global objective function
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling with competing agents, total late work and job rejection
- scientific article; zbMATH DE number 6672372 (Why is no real title available?)
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- A no-delay single machine scheduling problem to minimize total weighted early and 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
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Competitive two-agent scheduling with release dates and preemption on a single machine
- A new perspective on single-machine scheduling problems with late work related criteria
- Two-agent scheduling of equal-length jobs on uniform parallel machines
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- Scheduling with assignable due dates, two competing agents and late work related criteria
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work
- Single machine scheduling with the total weighted late work and rejection cost
- Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines
- A note on multi-agent scheduling to minimize the total weighted number of tardy jobs
- Minimizing total weighted late work with step-learning on a single machine
This page was built for publication: Single-machine scheduling with multi-agents to minimize total weighted late work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197329)
