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

DOI10.1016/J.COR.2011.05.026MaRDI QIDQ1761997zbMATH OpenOpenAlexFDO

Authors Ji-Bo Wang, Ming-Zheng 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

schedulingsingle-machineconvex resource allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• A survey of results for sequencing problems with controllable processing times
• A survey of scheduling with controllable processing times
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Just-in-time scheduling with controllable processing times on parallel machines
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Parallel machine scheduling with a convex resource consumption function

Cited in

(26)

• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
• 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 minmax common due-window assignment and scheduling problems with convex resource allocation
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• 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
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• Coupled task scheduling with convex resource consumption functions
• Research on common due window assignment flowshop scheduling with learning effect and resource allocation
• Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects
• Batch scheduling of identical jobs with controllable processing times
• On single machine scheduling with resource constraint
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Single-machine group scheduling with deteriorating jobs and allotted resource
• Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
• Resource allocation scheduling with deteriorating jobs and position-dependent workloads
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Resource dependent scheduling with truncated learning effects
• Heuristic methods for the single-machine scheduling problem with periodical resource constraints
• Single-machine due-window assignment and scheduling with learning effect and 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
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Resource cost aware scheduling

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)