Arc-flow approach for single batch-processing machine scheduling
From MaRDI portal
Publication:2669497
DOI10.1016/j.cor.2021.105394OpenAlexW3094229796MaRDI QIDQ2669497
Márcia H. C. Fampa, Olinto César Bassi de Araújo, Renan Spencer Trindade
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.12052
Related Items (4)
Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- Bin packing and related problems: general arc-flow formulation with graph compression
- Flowshop scheduling problem with a batching machine and task compatibilities
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Scheduling with batching: A review
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- Scheduling a single batch processing machine with non-identical job sizes
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Arc-flow approach for single batch-processing machine scheduling
