Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
From MaRDI portal
Publication:2075458
Recommendations
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- A Min-Max-Sum Resource Allocation Problem and Its Applications
- A mixed integer programming approach for the minimum maximal flow
- Minimax resource allocation problems: Optimization and parametric analysis
- Approximation Algorithms for the Maximum Concurrent Flow Problem
- Minimax resource allocation problems with ordering constraints
- A computational study of approximation algorithms for a minmax resource allocation problem
Cites work
- CON/SLK due date assignment and scheduling on a single machine with two agents
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
- A note on resource allocation scheduling with position-dependent workloads
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- A survey of scheduling with controllable processing times
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
- Flowshop scheduling with learning effect and job rejection
- Minmax scheduling problems with common due-date and completion time penalty
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- Multiagent scheduling. Models and algorithms
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Scheduling problems with position dependent job processing times: computational complexity results
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Single Machine Scheduling with Flow Allowances
- Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Time-dependent scheduling
- Total absolute deviation of job completion times on uniform and unrelated machines
Cited in
(7)- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- A note on resource allocation scheduling with position-dependent workloads
- Minimax scheduling problem with common due-date and controlled processing times and resource restriction
- Single machine slack due window assignment and deteriorating jobs
- Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
- Scheduling problems on parallel dedicated machines with non-renewable resource
- Single machine minsum and minmax common due date assignment and scheduling problems involving general position-dependent workloads
This page was built for publication: Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2075458)
