Serial batch scheduling on uniform parallel machines to minimize total completion time

DOI10.1016/J.IPL.2014.06.009MaRDI QIDQ402366zbMATH OpenOpenAlexFDO

Authors Song-Song Li, Yuzhong Zhang

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

zbMATH Keywords

schedulingrejectionpolynomial time algorithmtotal completion timeparallel machineserial batch

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• Serial-batching scheduling problem to minimize total weighted completion time
• Batch scheduling on uniform machines to minimize total flow-time
• scientific article; zbMATH DE number 5059917

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
• A survey on offline scheduling with rejection
• Batch scheduling on uniform machines to minimize total flow-time
• Batch sizing and job sequencing on a single machine
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing flow-time on a single machine with integer batch sizes
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Scheduling independent tasks to reduce mean finishing time
• Scheduling with batching: A review
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Single machine batch scheduling with resource dependent setup and processing times
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• The complexity of one-machine batching problems
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Two Queues with Changeover Times

Cited in

(8)

• Serial-batching scheduling problem to minimize total weighted completion time
• Batch scheduling on uniform machines to minimize total flow-time
• Parallel-batch scheduling on unrelated machines to minimize the sum objectives
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• Mixed batch scheduling on identical machines
• 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
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines

This page was built for publication: Serial batch scheduling on uniform parallel machines to minimize total completion time

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