Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
From MaRDI portal
Publication:271931
DOI10.1007/s10479-015-2054-7zbMath1334.90049OpenAlexW2225647301MaRDI QIDQ271931
Publication date: 20 April 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2054-7
single machine scheduling\(\mathcal{NP}\)-hardarbitrary release datestwo competing agentsunit processing times
Related Items (8)
Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Scheduling with competing agents, total late work and job rejection ⋮ 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 ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar
Cites Work
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A single-machine scheduling problem with two-agent and deteriorating jobs
- 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
- A note on ``Scheduling unit-time tasks with integer release times and deadlines
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- A note on the scheduling with two families of jobs
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Scheduling of unit-length independent tasks with execution constraints
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Scheduling unit-time tasks with integer release times and deadlines
- 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
- Parallel machine problems with equal processing times: a survey
- 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
- Multi-agent single machine scheduling
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Scheduling unit-length jobs with machine eligibility restrictions
- Multicriteria scheduling problems: a survey
- Competitive Two-Agent Scheduling and Its Applications
- Two-Agent Scheduling on an Unbounded Serial Batching Machine
- Scheduling Problems with Two Competing Agents
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Job Shop Scheduling with Unit Processing Times
- Multiagent Scheduling
This page was built for publication: Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
