Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
From MaRDI portal
Publication:2190797
Recommendations
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints
- Single-machine batch scheduling of linear deteriorating jobs
- Single-machine due-window assignment and scheduling with linear deteriorating jobs and deteriorating maintenance
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- Single-machine scheduling with deteriorating jobs
- Scheduling of single machine with deteriorating jobs and due-date assignment
- Single-machine scheduling with positional due indices and positional deadlines
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Single machine scheduling problems with deteriorating jobs
- Single machine scheduling with decreasing linear deterioration under precedence constraints
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1285632 (Why is no real title available?)
- scientific article; zbMATH DE number 7618570 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Complexity of scheduling with proportional deterioration and release dates
- Conjugate problems in time-dependent scheduling
- Coordination mechanisms for scheduling games with proportional deterioration
- Equivalent time-dependent scheduling problems
- Isomorphic scheduling problems
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Lawler's minmax cost problem under uncertainty
- Multiagent scheduling. Models and algorithms
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Parametric problem in scheduling theory
- Pareto minimizing total completion time and maximum cost with positional due indices
- Preemptive scheduling with simple linear deterioration on a single machine
- Reducibility among combinatorial problems
- Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs
- Rescheduling with new orders and general maximum allowable time disruptions
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling jobs under simple linear deterioration
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Scheduling with time-changing effects and rate-modifying activities
- Single machine parallel-batch scheduling with deteriorating jobs
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- Time-dependent scheduling
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Cited in
(6)- Single-machine online scheduling of jobs with non-delayed processing constraint
- A note on competing-agent Pareto-scheduling
- Single-machine scheduling with positional due indices and positional deadlines
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Online NDP-constraint scheduling of jobs with delivery times or weights
- Single-machine scheduling to minimize total weighted late work with positional due-indices
This page was built for publication: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190797)
