Single Machine Two-Agent Scheduling with Deteriorating Jobs

90B35: Deterministic scheduling theory in operations research

Related Items

Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects, Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures, Optimization of scheduling problems with deterioration effects and an optional maintenance activity, Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent, A just-in-time scheduling problem with two competing agents, ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost

Cites Work

Minimizing makespan in three-machine flow shops with deteriorating jobs
Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
Single-machine group scheduling with general deterioration and learning effects
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
Two-agent single-machine scheduling problems under increasing linear deterioration
A single-machine scheduling problem with two-agent and deteriorating jobs
Single machine group scheduling with time dependent processing times and ready times
Time-dependent scheduling
Scheduling time-dependent jobs under mixed deterioration
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
Multi-agent scheduling on a single machine with max-form criteria
Multi-agent single machine scheduling
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times
Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration
Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures
Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
Scheduling Problems with Two Competing Agents
NP-hard cases in scheduling deteriorating jobs on dedicated machines
Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs