Cover Image

A solution procedure for minimizing total completion time in a parallel-batching environment

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alfieri, Arianna, Druetto, Alessandro, Grosso, Andrea, Salassa, Fabio
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control 90C27 (Primary) 90C59 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
by: Druetto, Alessandro, et al.
Published: (2024)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
by: Badenbroek, Riley, et al.
Published: (2024)

CHAP: A Hybrid GPU-CPU Heuristic for MIP
by: Tjusila, Gennesaret Kharistio, et al.
Published: (2026)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
by: Gonçalves-Dosantos, Juan Carlos, et al.
Published: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Box Allocation Optimization in Meal Kit Delivery
by: Nguyen, Thi Minh Thu, et al.
Published: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
by: Hoogervorst, Rowan, et al.
Published: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
by: Im, Haesol, et al.
Published: (2024)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)

Metaheuristic algorithms for the induced P-median problem with upgrades
by: Salazar, Sergio, et al.
Published: (2026)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Polyhedral approximation of spectrahedral shadows via homogenization
by: Dörfler, Daniel, et al.
Published: (2023)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Penalty-Free SDDP: Feasibility Cuts for Robust Multi-Stage Stochastic Optimization in Energy Planning
by: Freitas, Guilherme, et al.
Published: (2025)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem
by: Kempke, Nils-Christian, et al.
Published: (2025)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Optimization of Closed-Loop Shallow Geothermal Systems Using Analytical Models
by: Heinzel, Oliver, et al.
Published: (2026)

Optimizing Flexibility in Power Systems by Maximizing the Region of Manageable Uncertainties
by: Zingler, Aron, et al.
Published: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)

Perpertual Coupled Simulated Annealing for Continuous Optimization
by: Gonçalves-e-Silva, Kayo, et al.
Published: (2018)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
by: Ryner, Martin, et al.
Published: (2024)

Multi-convex Programming for Discrete Latent Factor Models Prototyping
by: Zhu, Hao, et al.
Published: (2025)

Quantum computing and the stable set problem
by: Krpan, Aljaž, et al.
Published: (2024)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Bus Fleet Electrification Planning Through Logic-Based Benders Decomposition and Restriction Heuristics
by: Legault, Robin, et al.
Published: (2025)

A Comparison of Models for Rolling Stock Scheduling
by: Grimm, Boris, et al.
Published: (2023)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

Epi-Consistent Approximation of Stochastic Dynamic Programs
by: Keehan, Dominic S. T., et al.
Published: (2025)

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
by: Bai, Xiaoning, et al.
Published: (2022)

On the Out-of-Sample Performance of Stochastic Dynamic Programming and Model Predictive Control
by: Keehan, Dominic S. T., et al.
Published: (2025)