Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
DOI10.1016/J.COR.2014.06.020zbMATH Open1348.90261OpenAlexW2048737920MaRDI QIDQ337198FDOQ337198
Authors: 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
Recommendations
- Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Single machine two-agent scheduling with deteriorating jobs
- A two-agent scheduling problem with deterioration
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
algorithmsmaximum latenessNP-hardnessdeteriorating jobstotal weighted completion timeagent scheduling
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A multiple-criterion model for machine scheduling
- Scheduling Problems with Two Competing Agents
- Multiagent scheduling. Models and algorithms
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Time-dependent scheduling
- Single-machine multi-agent scheduling problems with a global objective function
- 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
- A New Library for Evolutionary Algorithms
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Sequencing unreliable jobs on parallel machines
Cited In (14)
- An uncertain parallel machine problem with deterioration and learning effect
- Scheduling with competing agents, total late work and job rejection
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
- Scheduling with two competing agents to minimize total weighted earliness
- Two-agent scheduling of time-dependent jobs
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine
- Two‐agent scheduling with linear resource‐dependent processing times
- Complexity of scheduling with proportional deterioration and release dates
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
This page was built for publication: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337198)
