Single machine scheduling with two competing agents and equal job processing times

DOI10.1016/j.ejor.2015.01.003zbMath1346.90378MaRDI QIDQ319290

Dvir Shabtay, George Steiner, Daniel Oron

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.003

zbMATH Keywords

complexity; single machine scheduling; two competing agents; equal processing times

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

Related Items

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, Two-agent single-machine scheduling with a rate-modifying activity, Competitive two-agent scheduling with release dates and preemption on a single machine, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Two-agent scheduling in a flowshop, Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, Two-agent parallel-machine scheduling with rejection, Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost, A note on competing-agent Pareto-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, Single-machine online scheduling of jobs with non-delayed processing constraint, 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, Two competitive agents to minimize the weighted total late work and the total completion time, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Bicriteria scheduling of equal length jobs on uniform parallel machines, Scheduling with release dates and preemption to minimize multiple max-form objective functions, Two-agent scheduling problems on a single-machine to minimize the total weighted late work, Scheduling with two competing agents to minimize total weighted earliness, Scheduling with competing agents, total late work and job rejection

Cites Work

• Unnamed Item
• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• Scheduling jobs with equal processing times subject to machine eligibility constraints
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• Real-time scheduling with a budget
• A note on the scheduling with two families of jobs
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Multicriteria optimization
• Scheduling unit processing time jobs on a single machine with multiple criteria
• An improved FPTAS for Restricted Shortest Path.
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• 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
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• A multiple-criterion model for machine scheduling
• Open-shop batch scheduling with identical jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multicriteria scheduling problems: a survey
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Approximation Schemes for the Restricted Shortest Path Problem
• Job Shop Scheduling with Unit Processing Times
• Multiagent Scheduling
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• A simple efficient approximation scheme for the restricted shortest path problem