Scheduling a batching machine with convex resource consumption functions
From MaRDI portal
Publication:1944176
DOI10.1016/j.ipl.2011.07.005zbMath1260.90095OpenAlexW2032933828MaRDI QIDQ1944176
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
algorithmsworkloadmakespanbatching machinetotal completion timeideal schedulesresource consumption function
Related Items (1)
Cites Work
- Scheduling a batching machine
- Single machine scheduling subject to deadlines and resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Minimizing completion time variance with compressible processing times
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing total completion time on a batch processing machine with job families
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
This page was built for publication: Scheduling a batching machine with convex resource consumption functions