A note on a two-agent scheduling problem related to the total weighted late work
From MaRDI portal
Publication:2424661
DOI10.1007/s10878-018-0337-zzbMath1423.90104OpenAlexW2885257301MaRDI QIDQ2424661
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0337-z
Related Items (14)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ 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 ⋮ 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 ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ A note on competing-agent Pareto-scheduling ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the scheduling with two families of jobs
- A two-agent single-machine scheduling problem with late work criteria
- Complexities of some problems on multi-agent scheduling on a single machine
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling Problems with Two Competing Agents
- Single Machine Scheduling to Minimize Total Late Work
- CON/SLK due date assignment and scheduling on a single machine with two agents
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Multiagent Scheduling
This page was built for publication: A note on a two-agent scheduling problem related to the total weighted late work
