Minimizing the total weighted flow time in a single machine with controllable processing times
type: Item
instance of: scholarly article
title: Minimizing the total weighted flow time in a single machine with controllable processing times
zbMATH Open document ID: 1073.90017
DOI: 10.1016/S0305-0548(03)00187-4
author: Dvir Shabtay
author: Moshe Kaspi
published in: Computers \& Operations Research
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91B76
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 2115388
zbMATH Keywords: Single-machine scheduling
zbMATH Keywords: Weighted flow time
zbMATH Keywords: Resource allocation
zbMATH Keywords: Optimization
zbMATH Keywords: Dynamic programming
zbMATH Keywords: Heuristics
MaRDI profile type: Publication
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Q3775317
cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
cites work: A multi-objective approach to resource allocation in single machine scheduling
cites work: Single machine scheduling subject to deadlines and resource dependent processing times
cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
cites work: Single machine batch scheduling with resource dependent setup and processing times
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: Allocation of resources in project management
cites work: Cost-effectiveness of a preventive counseling and support package for postnatal depression
cites work: Solving a class of two-resource allocation problem by equivalent load method
cites work: Some comments on sequencing with controllable processing times
description: scientific article; zbMATH DE number 2115388