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.007zbMath1188.90105OpenAlexW1978018515MaRDI QIDQ976033
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
Related Items (26)
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ 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 ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Just-in-time single-batch-processing machine scheduling ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ Exact methods for the oven scheduling problem ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ Bin Packing Problem with Time Lags ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ 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 ⋮ Integrated scheduling of production and distribution for manufacturers with parallel batching facilities ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Unnamed Item
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- Solving binary cutting stock problems by column generation and branch- and-bound
- An exact algorithm for IP column generation
- 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
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- Decomposition Principle for Linear Programs
- The Batch Loading and Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Column Generation Approach for Graph Coloring
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Scheduling a single batch processing machine with non-identical job sizes
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- Scheduling a batch processing machine with non-identical job sizes
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Scheduling jobs and maintenance activities on parallel machines
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock 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: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
