Minimizing total completion time on a batching machine with job processing time compatibilities

MaRDI QIDQ2861568zbMATH OpenFDO

Authors A. Bellanger, M. Y. Kovalyov, A. Oulamara

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001654

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing total completion time on a batch processing machine with job families
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• Minimizing the sum of the total completion time and batching costs on a batch processing machine
• Minimizing mean completion time in a batch processing system
• Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
• scientific article; zbMATH DE number 1792073
• scientific article; zbMATH DE number 5059917
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• An algorithm of minimizing the total weighted completed time on batch processing machine
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES

Cites work

• Batch processing with interval graph compatibilities between tasks
• Efficient algorithms for interval graphs and circular-arc graphs
• Flowshop scheduling problem with a batching machine and task compatibilities
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing mean completion time in a batch processing system
• Minimizing total completion time on a batch processing machine with job families
• On-line scheduling a batch processing system to minimize total weighted job completion time
• Scheduling a batching machine
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Scheduling on a batch machine with job compatibilities
• Scheduling with batching: A review

Cited in

(5)

• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
• Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
• Minimizing the Range of Order Completion Times with Multiple Job Classes
• Scheduling a Flexible Batching Machine
• A hybrid neural network approach to minimize total completion time on a single batch processing machine

This page was built for publication: Minimizing total completion time on a batching machine with job processing time compatibilities

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