Scheduling with two competing agents to minimize total weighted earliness
From MaRDI portal
Publication:2399317
DOI10.1007/s10479-016-2310-5zbMath1369.90074OpenAlexW2520890933MaRDI QIDQ2399317
Baruch Mor, Enrique Gerstl, Gur Mosheiov
Publication date: 22 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2310-5
Related Items (1)
Cites Work
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Solving a two-agent single-machine scheduling problem considering learning effect
- A multiple-criterion model for machine scheduling
- Multi-agent single machine scheduling
- Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures
- Scheduling Problems with Two Competing Agents
- Single machine just‐in‐time scheduling problems with two competing agents
- Multiagent Scheduling
This page was built for publication: Scheduling with two competing agents to minimize total weighted earliness
