Bin Packing Problem with Time Lags
From MaRDI portal
Publication:5106420
DOI10.1287/ijoc.2022.1165OpenAlexW3156150564MaRDI QIDQ5106420
François Clautiaux, Ruslan Sadykov, Orlando Rivera Letelier
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1165
algorithmsinteger programmingbranch-and-boundrelaxationcutting planescutting stockproduction-scheduling
Related Items
Uses Software
Cites Work
- Unnamed Item
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Procedures for the bin packing problem with precedence constraints
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Branching in branch-and-price: A generic scheme
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- New lower bounds for bin packing problems with conflicts
- The flexible periodic vehicle routing problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A generic exact solver for vehicle routing and related problems
- Logic-based Benders decomposition for scheduling a batching machine
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- Single machine scheduling subject to precedence delays
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An linear programming based lower bound for the simple assembly line balancing problem
- Mathematical Methods of Organizing and Planning Production
- Forty years of periodic vehicle routing
- Column Generation based Primal Heuristics
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- The Bin Packing Problem with Precedence Constraints
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Bin Packing Problem with Time Lags
