Column generation for minimizing total completion time in a parallel-batching environment
From MaRDI portal
Abstract: In many manufacturing processes, batch processing is frequently needed for capacity reasons. This applies both to parallel and serial batching. However, while the serial batch processing is largely studied in the literature, as it is related to the setup issues, the parallel batch processing is less investigated. In parallel batching, the manufacturing facility (e.g., ovens for burn-in operations) is able to accommodate, and process, several parts at the same time and not to exploit such ability leads to a reduction in the capacity of the manufacturing facility itself, which will be able to process less parts per time unit. In this paper, the scheduling problem in batch processing environments is considered. Specifically a column generation algorithm is proposed for parallel batching in both single machine and parallel machine layouts. Numerical results show that the proposed algorithm is able to achieve good solutions in reasonable computation time due to the use of a new developed lower bound much stronger than the literature available lower bounds.
Recommendations
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- Parallel machine scheduling by column generation
- Column generation for solving parallel machine scheduling problem
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A new MIP model for parallel-batch scheduling with non-identical job sizes
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Network flows. Theory, algorithms, and applications.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling a single batch processing machine with non-identical job sizes
- Solving single batch-processing machine problems using an iterated heuristic
- Split-merge: using exponential neighborhood search for scheduling a batching machine
Cited in
(10)- Using extra dual cuts to accelerate column generation
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- Parallel batching with multi-size jobs and incompatible job families
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- Distributed asynchronous column generation
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches
- Exact algorithms to minimize makespan on single and parallel batch processing machines
This page was built for publication: Column generation for minimizing total completion time in a parallel-batching environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2066680)
