scientific article; zbMATH DE number 1792073

MaRDI QIDQ4552014zbMATH OpenFDO

Authors Kanesan Muthusamy, Teruo Masuda, Shintaro Mohri, Hiroaki Ishii

Publication date 12 February 2003

zbMATH Keywords

polynomially bounded algorithmsingle machine batching problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A polynomial algorithm for a one machine batching problem
• A single machine batch scheduling problem with bounded batch size
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• scientific article; zbMATH DE number 5671136
• Batch-processing scheduling with setup times

Cited in

(10)

• Solving single batch-processing machine problems using an iterated heuristic
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Minimizing total completion time on a batching machine with job processing time compatibilities
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• scientific article; zbMATH DE number 1420452 (Why is no real title available?)
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• A single machine batch scheduling problem with bounded batch size
• Batch scheduling to minimize total completion time
• Triangle structure diagrams for a single machine batching problem with identical jobs

This page was built for publication:

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