ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
DOI10.1016/j.amc.2019.124697zbMath1433.90062OpenAlexW2971522950WikidataQ127291061 ScholiaQ127291061MaRDI QIDQ2284315
Jinjiang Yuan, Zhichao Geng, Rubing Chen
Publication date: 14 January 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124697
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Rescheduling with new orders and general maximum allowable time disruptions
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Scheduling with time-changing effects and rate-modifying activities
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- A note on the scheduling with two families of jobs
- Pareto minimizing total completion time and maximum cost with positional due indices
- A concise survey of scheduling with time-dependent processing times
- Complexities of four problems on two-agent scheduling
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Complexities of some problems on multi-agent scheduling on a single machine
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Two-agent scheduling of time-dependent jobs
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- Single-machine multi-agent scheduling problems with a global objective function
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- Competitive Two-Agent Scheduling and Its Applications
- 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
- Parametric problem in scheduling theory
- Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Multiagent Scheduling
- Single Machine Two-Agent Scheduling with Deteriorating Jobs
This page was built for publication: ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
