Single machine scheduling with two competing agents and equal job processing times
From MaRDI portal
Publication:319290
DOI10.1016/J.EJOR.2015.01.003zbMATH Open1346.90378OpenAlexW1972249265MaRDI QIDQ319290FDOQ319290
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
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Multicriteria optimization
- An improved FPTAS for Restricted Shortest Path.
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- A simple efficient approximation scheme for the restricted shortest path problem
- Complexity of single machine scheduling subject to nonnegative inventory constraints
- Scheduling unit processing time jobs on a single machine with multiple criteria
- 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
- 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
- Multicriteria scheduling problems: a survey
- Competitive Two-Agent Scheduling and Its Applications
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Scheduling Problems with Two Competing Agents
- Job Shop Scheduling with Unit Processing Times
- Multiagent Scheduling
- 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
- A note on the scheduling with two families of jobs
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Real-time scheduling with a budget
Cited In (27)
- Scheduling with competing agents, total late work and job rejection
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single-machine online scheduling of jobs with non-delayed processing constraint
- A note on competing-agent Pareto-scheduling
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Two competitive agents to minimize the weighted total late work and the total completion time
- Single machine just‐in‐time scheduling problems with two competing agents
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Scheduling with two competing agents to minimize total weighted earliness
- 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
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Group Scheduling with Two Competing Agents on a Single Machine
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Two-agent scheduling in a flowshop
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Two-agent single-machine scheduling with a rate-modifying activity
- Two-agent parallel-machine scheduling with rejection
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
- Single-machine scheduling with multi-agents to minimize total weighted late work
Recommendations
- Single machine just‐in‐time scheduling problems with two competing agents 👍 👎
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times 👍 👎
- Single machine batch scheduling with two competing agents to minimize total flowtime 👍 👎
- Scheduling two job families on a single machine with two competitive agents 👍 👎
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times 👍 👎
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes 👍 👎
- Two-agent single-machine scheduling problem with just-in-time jobs 👍 👎
- Single-machine scheduling with two competing agents and learning consideration 👍 👎
- Single machine family scheduling with two competing agents to minimize makespan 👍 👎
This page was built for publication: Single machine scheduling with two competing agents and equal job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319290)
