Convex resource allocation for minimizing the makespan in a single machine with job release dates

DOI10.1016/S0305-0548(03)00103-5zbMath1076.68018OpenAlexW1963836961MaRDI QIDQ1881652

Moshe Kaspi, Dvir Shabtay

Publication date: 14 October 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00103-5

zbMATH Keywords

Single machine schedulingConvex resource allocationRelease dates and optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources ⋮ Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Slack due window assignment scheduling in the single-machine with controllable processing times ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ A note on two-agent scheduling with resource dependent release times on a single machine ⋮ Resource constrained scheduling with general truncated job-dependent learning effect ⋮ Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates ⋮ Parallel machine scheduling with a convex resource consumption function ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Cites Work

• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Single machine scheduling subject to deadlines and resource dependent processing times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Solving a class of two-resource allocation problem by equivalent load method
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Allocation of resources in project management
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex resource allocation for minimizing the makespan in a single machine with job release dates