Two-agent scheduling problems on a single-machine to minimize the total weighted late work
From MaRDI portal
Publication:2359798
DOI10.1007/s10878-016-0017-9zbMath1372.90055OpenAlexW2340006867MaRDI QIDQ2359798
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0017-9
Related Items
Pareto-scheduling of two competing agents with their own equal processing times, Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work, Scheduling with competing agents, total late work and job rejection, 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, A survey of due-date related single-machine with two-agent scheduling problem, 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, A note on a two-agent scheduling problem related to the total weighted late work, 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 preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work, A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion, 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, Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
Cites Work
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- Two-agent scheduling in a flowshop
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Scheduling two agents with controllable processing times
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- 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
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Single Machine Scheduling to Minimize Total Late Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
