A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
From MaRDI portal
Publication:6552674
Production models (90B30) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- A two-agent scheduling problem with deterioration
- Single machine scheduling problem with deteriorating maintenance and resource allocation
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
Cites work
- A single-machine scheduling with a truncated linear deterioration and ready times
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Delay-tolerant distributed algorithms for decision-making in vehicular networks
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- Dominance inequalities for scheduling around an unrestrictive common due date
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- Due-window assignment scheduling in the proportionate flow shop setting
- Due-window assignment scheduling with job-rejection, truncated learning effects and setup times
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates
- Minmax common due-window assignment scheduling with deteriorating jobs
- Models and algorithms of time-dependent scheduling
- Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
- Permutation flow shop scheduling with makespan objective and truncated learning effects
- Research on delivery times scheduling with sum of logarithm processing times-based learning effect
- Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
- Scheduling jobs with general truncated learning effects including proportional setup times
- Single machine slack due window assignment and deteriorating jobs
- Single-machine time-dependent scheduling with proportional and delivery times
- Supply chain scheduling with deteriorating jobs and delivery times
- The due date assignment scheduling problem with the deteriorating jobs and delivery time
- Two-agent scheduling with linear-deteriorating jobs and release dates on a single machine
- Two-agent single-machine scheduling with cumulative deterioration
Cited in
(11)- Single-machine group scheduling with general linear deterioration and truncated learning effects
- Study on single-machine group scheduling with convex resource allocations and different due-date assignments
- Scheduling with assignable due dates, two competing agents and late work related criteria
- Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
- Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments
- Delivery scheduling with variable processing times and due date assignments
- Minmax delivery completion time scheduling with delivery times and deteriorating jobs
- Minimizing range of job completion times with general position-dependent processing times and job-rejection
- Single-machine and flow-shop scheduling with supporting tasks in a nested structure
- Min-max regret single machine scheduling with due-date assignment and interval processing times
- Total weighted completion time scheduling under resource allocation and time-dependent learning effects
This page was built for publication: A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552674)
