Two-agent single-machine scheduling problems under increasing linear deterioration
From MaRDI portal
Publication:552491
DOI10.1016/j.apm.2010.11.026zbMath1217.90108OpenAlexW1993080431MaRDI QIDQ552491
Publication date: 21 July 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.11.026
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (25)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Parallel-machine scheduling with non-simultaneous machine available time ⋮ Two-agent scheduling of time-dependent jobs ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Two-agent scheduling problems with the general position-dependent processing time ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs
Cites Work
- Unnamed Item
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- A note on the scheduling with two families of jobs
- Learning effect and deteriorating jobs in the single machine scheduling problems
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Optimal two- and three-stage production schedules with setup times included
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Two-agent single-machine scheduling problems under increasing linear deterioration
