One-dimensional bin packing with pattern-dependent processing time
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A combinatorial flow-based formulation for temporal bin packing problems
- A constraint programming approach for a batch processing problem with non-identical job sizes
- A dynamic programming heuristic for the quadratic knapsack problem
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- A survey of scheduling with parallel batch (p-batch) processing
- An improved typology of cutting and packing problems
- BPPLIB: a library for bin packing and cutting stock problems
- Benchmarking optimization software with performance profiles.
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Lower bounds and reduction procedures for the bin packing problem
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
- New exact approaches and approximation results for the penalized knapsack problem
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducing the number of cuts in generating three-staged cutting patterns
- Resource constrained scheduling as generalized bin packing
- Scheduling
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling with batching: A review
- Selected Topics in Column Generation
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- The one-dimensional cutting stock problem with due dates
- The quadratic knapsack problem -- a survey
- Two-dimensional cutting stock problem with sequence dependent setup times
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
This page was built for publication: One-dimensional bin packing with pattern-dependent processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982052)
