Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
type: Item
instance of: scholarly article
title: Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
zbMATH Open document ID: 1251.90197
author: Ji-Bo Wang
author: Ming-Zheng Wang
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6107482
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: convex resource allocation
MaRDI profile type: Publication
full work available at URL: j.cor.2011.05.026
OpenAlex ID: W2039235216
cites work: Q4166568
cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates
cites work: Just-in-time scheduling with controllable processing times on parallel machines
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Optimal due date assignment and resource allocation in a group technology scheduling environment
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: Parallel machine scheduling with a convex resource consumption function
cites work: A survey of scheduling with controllable processing times
DOI: 10.1016/J.COR.2011.05.026
description: scientific article; zbMATH DE number 6107482