Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
From MaRDI portal
Publication:1761997
DOI10.1016/J.COR.2011.05.026zbMATH Open1251.90197OpenAlexW2039235216MaRDI QIDQ1761997FDOQ1761997
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.026
Recommendations
- Minimizing the total weighted flow time in a single machine with controllable processing times
- On minimizing resource consumption with constraints on the makespan and the total completion time
- Two-machine flow shop scheduling with convex resource consumption functions
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
Cites Work
- A survey of scheduling with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- Title not available (Why is that?)
- Just-in-time scheduling with controllable processing times on parallel machines
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Parallel machine scheduling with a convex resource consumption function
Cited In (22)
- A note on two-agent scheduling with resource dependent release times on a single machine
- Two-machine flow shop scheduling with convex resource consumption functions
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
- A unified analysis for scheduling problems with variable processing times
- Research on common due window assignment flowshop scheduling with learning effect and resource allocation
- Batch scheduling of identical jobs with controllable processing times
- Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
- Single-machine group scheduling with deteriorating jobs and allotted resource
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Resource dependent scheduling with truncated learning effects
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- A note on resource allocation scheduling with position-dependent workloads
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
- Resource cost aware scheduling
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
This page was built for publication: Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761997)
