Convex resource allocation for minimizing the makespan in a single machine with job release dates
type: Item
instance of: scholarly article
title: Convex resource allocation for minimizing the makespan in a single machine with job release dates
zbMATH Open document ID: 1076.68018
DOI: 10.1016/S0305-0548(03)00103-5
author: Moshe Kaspi
author: Dvir Shabtay
published in: Computers \& Operations Research
publication date: 2004-10-14T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2107862
zbMATH Keywords: Single machine scheduling
zbMATH Keywords: Convex resource allocation
zbMATH Keywords: Release dates and optimization
MaRDI profile type: Publication
cites work: Q3775317
cites work: A bicriterion approach to time/cost trade-offs in sequencing
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: 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: Q5806966
full work available at URL: s0305-0548(03)00103-5
OpenAlex ID: W1963836961
description: scientific article; zbMATH DE number 2107862