Scheduling a batching machine with convex resource consumption functions

DOI10.1016/J.IPL.2011.07.005MaRDI QIDQ1944176zbMATH OpenOpenAlexFDO

Authors Daniel Oron

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.07.005

zbMATH Keywords

algorithmsbatching machineideal schedulesmakespanresource consumption functiontotal completion timeworkload

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Convex programming (90C25)

Recommendations

• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times
• Single machine batch scheduling with resource dependent setup and processing times
• Parallel machine scheduling with a convex resource consumption function
• Batch scheduling of identical jobs with controllable processing times

Cites work

• A survey of scheduling with controllable processing times
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Minimizing completion time variance with compressible processing times
• Minimizing total completion time on a batch processing machine with job families
• Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
• Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
• Scheduling a batching machine
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling with controllable release and processing parameters
• Two parallel machine sequencing problems involving controllable job processing times

Cited in

(2)

• A unified view of parallel machine scheduling with interdependent processing rates
• Single machine batch scheduling to minimize total completion time and resource consumption costs

This page was built for publication: Scheduling a batching machine with convex resource consumption functions

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