Exact algorithms to minimize makespan on single and parallel batch processing machines
From MaRDI portal
Publication:2183850
DOI10.1016/j.ejor.2020.01.065zbMath1441.90066OpenAlexW3006185376MaRDI QIDQ2183850
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.065
Related Items (11)
Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ 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 ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Weighted completion time minimization for capacitated parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Partitioning procedures for solving mixed-variables programming problems
- Scheduling a batching machine
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
- Decomposition Principle for Linear Programs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Scheduling a single batch processing machine with non-identical job sizes
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Shortest Path Problems with Resource Constraints
- Implementing Mixed Integer Column Generation
- Scheduling
This page was built for publication: Exact algorithms to minimize makespan on single and parallel batch processing machines
