Scheduling problems on parallel dedicated machines with non-renewable resource

DOI10.1007/S10479-025-06471-5MaRDI QIDQ7002470zbMATH OpenFDO

Authors Baruch Mor, Joanna Berlińska

Publication date 3 April 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-025-06471-5

zbMATH Keywords

convex resource allocationmakespanparallel dedicated machinesschedulingtotal loadtotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation
• A note on resource allocation scheduling with position-dependent workloads
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• A survey of scheduling with controllable processing times
• Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Coupled task scheduling with convex resource consumption functions
• Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
• Models and algorithms of time-dependent scheduling
• Parallel machine scheduling with a convex resource consumption function
• Resource allocation scheduling with deteriorating jobs and position-dependent workloads
• Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
• Scheduling with time-changing effects and rate-modifying activities
• Server scheduling on parallel dedicated machines with fixed job sequences
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology

Cited in

(1)

• Exact algorithms for energy-constrained scheduling on identical parallel machines

This page was built for publication: Scheduling problems on parallel dedicated machines with non-renewable resource

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002470)