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.026zbMath1251.90197OpenAlexW2039235216MaRDI QIDQ1761997
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
Related Items
Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times, Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times, A note on resource allocation scheduling with position-dependent workloads, Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation, 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 Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times, Bicriterion scheduling with truncated learning effects and convex controllable processing times, Resource dependent scheduling with truncated learning effects, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Single-machine group scheduling with deteriorating jobs and allotted resource, A note on two-agent scheduling with resource dependent release times on a single machine, Heuristic methods for the single-machine scheduling problem with periodical resource constraints, Resource cost aware scheduling, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, A unified analysis for scheduling problems with variable processing times, Resource allocation scheduling with deteriorating jobs and position-dependent workloads, Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects
Cites Work
- Unnamed Item
- A survey of results for sequencing problems with controllable processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A survey of scheduling with controllable processing times
- Parallel machine scheduling with a convex resource consumption function
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
