Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
From MaRDI portal
Publication:2190797
DOI10.1007/s10288-019-00410-4zbMath1442.90068OpenAlexW2955229224MaRDI QIDQ2190797
Publication date: 22 June 2020
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00410-4
Related Items (4)
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 ⋮ A note on competing-agent Pareto-scheduling ⋮ Single-machine online scheduling of jobs with non-delayed processing constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lawler's minmax cost algorithm: optimality conditions and uncertainty
- Rescheduling with new orders and general maximum allowable time disruptions
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- Scheduling with time-changing effects and rate-modifying activities
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
- Preemptive scheduling with simple linear deterioration on a single machine
- Isomorphic scheduling problems
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Pareto minimizing total completion time and maximum cost with positional due indices
- Time-dependent scheduling
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single machine parallel-batch scheduling with deteriorating jobs
- Conjugate problems in time-dependent scheduling
- Equivalent time-dependent scheduling problems
- Scheduling jobs under simple linear deterioration
- Coordination mechanisms for scheduling games with proportional deterioration
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Complexity of scheduling with proportional deterioration and release dates
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Lawler's minmax cost problem under uncertainty
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- Parametric problem in scheduling theory
- Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
- Reducibility among Combinatorial Problems
- Multiagent Scheduling
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
