scientific article; zbMATH DE number 563208
From MaRDI portal
Publication:4290987
DOI10.1002/1520-6750(199406)41:4%3C579::AID-NAV3220410409%3E3.0.CO;2-GzbMATH Open0809.90111MaRDI QIDQ4290987FDOQ4290987
Authors: David Simchi-Levi 
Publication date: 5 May 1994
Title of this publication is not available (Why is that?)
Recommendations
Cited In (91)
- The inventory packing problem
- Analysis of a first-fit algorithm for the capacitated unit covering problem
- Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty
- More on batched bin packing
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- Offline black and white bin packing
- Title not available (Why is that?)
- Online bin packing of squares and cubes
- On capacitated covering with unit balls
- Approximate strip packing: revisited
- Title not available (Why is that?)
- A-shaped bin packing: Worst case analysis via simulation
- Batch scheduling of nonidentical job sizes with minsum criteria
- On bin packing with clustering and bin packing with delays
- Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
- Approximation algorithms for constructing some required structures in digraphs
- NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Heuristic solution of open bin packing problems
- Online results for black and white bin packing
- Knowledge-guided local search for the vehicle routing problem
- Best \(k\)-fit bin packing
- Approximation schemes for packing splittable items with cardinality constraints
- An improved two-machine flowshop scheduling with intermediate transportation
- An APTAS for bin packing with clique-graph conflicts
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- Improved algorithms for two single machine scheduling problems
- On the machine scheduling problem with job delivery coordination
- Scheduling with job delivery coordination on single machine
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Modified subset sum heuristics for bin packing
- Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
- The FFD algorithm for the bin packing problem with kernel items
- The optimal absolute ratio for online bin packing
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- On residual approximation in solution extension problems
- NF-based algorithms for online bin packing with buffer and bounded item size
- Worst-case analysis of the subset sum algorithm for bin packing.
- Single machine scheduling with job delivery to multiple customers
- Linear time-approximation algorithms for bin packing
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)
- Machine scheduling with job delivery coordination
- On the absolute approximation ratio for first fit and related results
- Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
- Single-machine scheduling with periodic maintenance to minimize makespan
- Approximations for constructing tree-form structures using specific material with fixed length
- Solution approaches for the cutting stock problem with setup cost
- Parallel approximation algorithms for bin packing
- Fixed-parameter approximation: conceptual framework and approximability results
- Bin packing with divisible item sizes and rejection penalties
- Performance of Heuristics for a Computer Resource Allocation Problem
- Tight results for next fit and worst fit with resource augmentation
- Online packing of arbitrary sized items into designated and multipurpose bins
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- Bin packing problems with rejection penalties and their dual problems
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- A 3-approximation algorithm for two-dimensional bin packing
- On Residual Approximation in Solution Extension Problems
- PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION
- The freight consolidation and containerization problem
- A one-dimensional bin packing problem with shelf divisions
- Bin‐packing problem with concave costs of bin utilization
- Solving a fuel delivery problem by heuristic and exact approaches.
- Online algorithm for 1-space bounded multi-dimensional bin packing
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- Approximation algorithms for a hierarchically structured bin packing problem
- Scheduling jobs under increasing linear machine maintenance time
- Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- Bin packing with rejection revisited
- Maximizing the number of unused bins
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- An improved approximation scheme for variable-sized bin packing
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Approximation algorithms for time constrained scheduling
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Title not available (Why is that?)
- Analysis of a Compound Bin Packing Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Order acceptance and scheduling with consideration of service level
- Title not available (Why is that?)
- Bin packing problem with conflicts and item fragmentation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290987)
