One-dimensional bin packing with pattern-dependent processing time

No abstract is available for this paper.

• Publication year

  2024

• Venue

  European Journal of Operational Research

• Publication date

  2024-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2024.11.023
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern

  2023cited by this paper
• A combinatorial flow-based formulation for temporal bin packing problems

  2022cited by this paper
• Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups

  2022cited by this paper
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing

  2021cited by this paper
• A survey of scheduling with parallel batch (p-batch) processing

  2021cited by this paper
• Just-in-time two-dimensional bin packing

  2020cited by this paper
• Number of bins and maximum lateness minimization in two-dimensional bin packing

  2020cited by this paper
• Pricing-based primal and dual bounds for selected packing problems

  2020cited by this paper
• Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems

  2020cited by this paper
• A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders

  2019cited by this paper
• Two-dimensional cutting stock problem with sequence dependent setup times

  2018cited by this paper
• New exact approaches and approximation results for the Penalized Knapsack Problem

  2017cited by this paper
• BPPLIB: a library for bin packing and cutting stock problems

  2017cited by this paper
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system

  2017cited by this paper
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates

  2017cited by this paper
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories

  2017cited by this paper
• A vulcanising decision planning as a particular one-dimensional cutting stock problem with limited part-related tooling in make-to-order industrial environments

  2017cited by this paper
• Maximum lateness minimization in one-dimensional bin packing

  2017cited by this paper
• Bin Packing Problems with Variable Pattern Processing Times: A Proof-of-concept

  2017cited by this paper
• Combined cutting stock and scheduling: a matheuristic approach

  2016cited by this paper
• Bin packing and cutting stock problems: Mathematical models and exact algorithms

  2016cited by this paper
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem

  2014cited by this paper
• On cutting stock with due dates

  2014cited by this paper
• A genetic algorithm for two-dimensional bin packing with due dates

  2013cited by this paper
• Reducing the number of cuts in generating three-staged cutting patterns

  2012cited by this paper
• A constraint programming approach for a batch processing problem with non-identical job sizes

  2012cited by this paper
• An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes

  2010cited by this paper
• The one-dimensional cutting stock problem with due dates

  2010cited by this paper
• An improved typology of cutting and packing problems

  2007cited by this paper
• The quadratic knapsack problem - a survey

  2007cited by this paper
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

  2007cited by this paper
• Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

  2002cited by this paper
• Selected Topics in Column Generation

  2002cited by this paper
• A genetic algorithm to minimize maximum lateness on a batch processing machine

  2002cited by this paper
• Scheduling with batching: A review

  2000cited by this paper
• Scheduling a single batch processing machine with non-identical job sizes

  1994cited by this paper
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

  1992cited by this paper
• Lower bounds and reduction procedures for the bin packing problem

  1990cited by this paper
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

  1977cited by this paper
• Resource Constrained Scheduling as Generalized Bin Packing

  1976cited by this paper
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

  1974cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper
• Mathematical Methods of Organizing and Planning Production

  1960cited by this paper

• The overflowing bin packing problem: theoretical results and compact ILP formulations

  2026cites this paper
• Eigen+: Memory Over-Subscription for Alibaba Cloud Databases

  2025cites this paper
• Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing

  2025cites this paper