A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
From MaRDI portal
Publication:976033
DOI10.1016/J.COR.2009.12.007zbMATH Open1188.90105OpenAlexW1978018515MaRDI QIDQ976033FDOQ976033
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.12.007
Recommendations
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- Scheduling a single batch processing machine with non-identical job sizes
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
Cites Work
- An exact algorithm for IP column generation
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Decomposition Principle for Linear Programs
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- A set-covering-based heuristic approach for bin-packing problems
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- A Column Generation Approach for Graph Coloring
- Scheduling a single batch processing machine with non-identical job sizes
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- 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
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Solving binary cutting stock problems by column generation and branch- and-bound
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling jobs and maintenance activities on parallel machines
- The Batch Loading and Scheduling Problem
Cited In (29)
- Arc-flow approach for single batch-processing machine scheduling
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
- Exact methods for the oven scheduling problem
- A branch and price algorithm for single-machine completion time variance
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
- Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
- Bin Packing Problem with Time Lags
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Quality assurance laboratory planning system to maximize worker preference subject to certification and preference balance constraints
- Algorithms and implementation of a set partitioning approach for modular machining line design
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- Tactical fixed job scheduling with spread-time constraints
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- A constraint programming approach for a batch processing problem with non-identical job sizes
- 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
- Just-in-time single-batch-processing machine scheduling
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Column generation for minimizing total completion time in a parallel-batching environment
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- A survey of scheduling with parallel batch (p-batch) processing
This page was built for publication: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976033)
