Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

DOI10.1016/j.cor.2011.05.026zbMath1251.90197MaRDI QIDQ1761997

Ming-Zheng Wang, Ji-Bo Wang

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

zbMATH Keywords

scheduling; single-machine; convex resource allocation

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects, 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, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, Batch scheduling of identical jobs with controllable processing times, Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times, A note on two-agent scheduling with resource dependent release times on a single machine, Resource cost aware scheduling, Heuristic methods for the single-machine scheduling problem with periodical resource constraints, A unified analysis for scheduling problems with variable processing times, Resource allocation scheduling with deteriorating jobs and position-dependent workloads, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Single-machine group scheduling with deteriorating jobs and allotted resource, Resource dependent scheduling with truncated learning effects, Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times, Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

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