Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
DOI10.1016/j.cor.2014.06.020zbMath1348.90261OpenAlexW2048737920MaRDI QIDQ337198
Stanisław Gawiejnowicz, Cezary Suwalski
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.020
algorithmsdeteriorating jobsNP-hardnessmaximum latenesstotal weighted completion timeagent scheduling
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Cites Work
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Sequencing unreliable jobs on parallel machines
- Time-dependent scheduling
- Scheduling two agents with controllable processing times
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Scheduling jobs under simple linear deterioration
- Solving a two-agent single-machine scheduling problem considering learning effect
- Single-machine multi-agent scheduling problems with a global objective function
- A multiple-criterion model for machine scheduling
- A New Library for Evolutionary Algorithms
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling Problems with Two Competing Agents
- Multiagent Scheduling
This page was built for publication: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria