Two‐agent scheduling with linear resource‐dependent processing times
From MaRDI portal
Publication:6072167
DOI10.1002/nav.21936zbMath1523.90207OpenAlexW3046980181MaRDI QIDQ6072167
Cheng, T. C. Edwin, Yunqiang Yin, Yugang Yu, Huaxin Qiu, Du-Juan Wang
Publication date: 12 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21936
resource allocationtwo-agent schedulingfully polynomial-time approximation schemeproximal bundle algorithm
Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Scheduling with competing agents, total late work and job rejection ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
Cites Work
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Simultaneous job scheduling and resource allocation on parallel machines
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Scheduling two agents with controllable processing times
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
- A survey of scheduling with controllable processing times
- Integrated truck and workforce scheduling to accelerate the unloading of trucks
- Unbounded parallel-batching scheduling with two competitive agents
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- Competitive Two-Agent Scheduling and Its Applications
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Scheduling Problems with Two Competing Agents
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to minimize the total compression and late costs
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Single machine just‐in‐time scheduling problems with two competing agents
- CON/SLK due date assignment and scheduling on a single machine with two agents
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- Reducibility among Combinatorial Problems
This page was built for publication: Two‐agent scheduling with linear resource‐dependent processing times
