Serial batch scheduling on uniform parallel machines to minimize total completion time
From MaRDI portal
Publication:402366
DOI10.1016/j.ipl.2014.06.009zbMath1371.90058OpenAlexW2079103781MaRDI QIDQ402366
Publication date: 28 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.009
Related Items (3)
Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing ⋮ Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines ⋮ Mixed batch scheduling on identical machines
Cites Work
- Unnamed Item
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A survey on offline scheduling with rejection
- Batch sizing and job sequencing on a single machine
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- The complexity of one-machine batching problems
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- Batch scheduling on uniform machines to minimize total flow-time
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
- Scheduling with batching: A review
- Minimizing flow-time on a single machine with integer batch sizes
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Scheduling Groups of Jobs on a Single Machine
- Two Queues with Changeover Times
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Single machine batch scheduling with resource dependent setup and processing times
This page was built for publication: Serial batch scheduling on uniform parallel machines to minimize total completion time