Two-agent scheduling problems on a single-machine to minimize the total weighted late work
From MaRDI portal
Publication:2359798
Recommendations
- Two-agent scheduling problem about total late work on a single machine
- A note on a two-agent scheduling problem related to the total weighted late work
- Two-agent single machine scheduling problem with the total weighted early work
- A two-agent single-machine scheduling problem with late work criteria
- Single-machine scheduling with multi-agents to minimize total weighted late work
Cites work
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Competitive two-agent scheduling and its applications
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling Problems with Two Competing Agents
- Scheduling two agents with controllable processing times
- 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
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Two-agent scheduling in a flowshop
- Two-agent single-machine scheduling problems under increasing linear deterioration
Cited in
(33)- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- A two-agent single-machine scheduling problem with late work criteria
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- 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
- 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
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Two competitive agents to minimize the weighted total late work and the total completion time
- Two-agent single-machine scheduling problem with just-in-time jobs
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- 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
- A note on a two-agent scheduling problem related to the total weighted late work
- Scheduling with competing agents, total late work and job rejection
- Two-agent single machine scheduling problem with the total weighted early work
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- scientific article; zbMATH DE number 6531341 (Why is no real title available?)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Two-agent single-machine scheduling with resource-dependent starting times
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- scientific article; zbMATH DE number 7113489 (Why is no real title available?)
- Two-agent scheduling problem about total late work on a single machine
- Two-agent scheduling problem about tardiness on a single machine
- 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
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Two-agent single-machine scheduling with a rate-modifying activity
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Two-agent scheduling in a two-machine open shop
- Two-agent scheduling of minimizing total weighted late work and maximum cost
This page was built for publication: Two-agent scheduling problems on a single-machine to minimize the total weighted late work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359798)
