scientific article; zbMATH DE number 563208
From MaRDI portal
Publication:4290987
DOI<579::AID-NAV3220410409>3.0.CO;2-G 10.1002/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-GzbMath0809.90111MaRDI QIDQ4290987
Publication date: 5 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An improved two-machine flowshop scheduling with intermediate transportation ⋮ Machine scheduling with job delivery coordination ⋮ Single machine scheduling with job delivery to multiple customers ⋮ An APTAS for bin packing with clique-graph conflicts ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ On residual approximation in solution extension problems ⋮ Bin packing with divisible item sizes and rejection penalties ⋮ Approximate strip packing: revisited ⋮ Fixed-parameter approximation: conceptual framework and approximability results ⋮ Approximations for constructing tree-form structures using specific material with fixed length ⋮ Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces ⋮ Bin packing with rejection revisited ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Single-machine scheduling with periodic maintenance to minimize makespan ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem ⋮ Improved algorithms for two single machine scheduling problems ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Tighter bounds of the First Fit algorithm for the bin-packing problem ⋮ On the machine scheduling problem with job delivery coordination ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length ⋮ On Residual Approximation in Solution Extension Problems ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP ⋮ Two-machine flowshop scheduling with intermediate transportation under job physical space consideration ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Solving a fuel delivery problem by heuristic and exact approaches. ⋮ Unnamed Item ⋮ Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) ⋮ PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION ⋮ On the absolute approximation ratio for first fit and related results ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ On bin packing with clustering and bin packing with delays ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ The optimal absolute ratio for online bin packing ⋮ Approximation algorithms for time constrained scheduling ⋮ An improved approximation scheme for variable-sized bin packing ⋮ Scheduling with job delivery coordination on single machine ⋮ Minimizing makespan on a single batch processing machine with nonidentical job sizes ⋮ Order acceptance and scheduling with consideration of service level ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ A one-dimensional bin packing problem with shelf divisions ⋮ Approximation algorithms for constructing some required structures in digraphs ⋮ The freight consolidation and containerization problem ⋮ A 3-approximation algorithm for two-dimensional bin packing ⋮ Online bin packing of squares and cubes ⋮ Scheduling jobs under increasing linear machine maintenance time ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ Bin packing problem with conflicts and item fragmentation ⋮ More on batched bin packing ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Unbounded parallel batch scheduling with job delivery to minimize makespan ⋮ Two parallel machines scheduling with two-vehicle job delivery to minimize makespan ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ Analysis of a first-fit algorithm for the capacitated unit covering problem ⋮ The FFD algorithm for the bin packing problem with kernel items ⋮ Approximation algorithms for a hierarchically structured bin packing problem ⋮ A new heuristic algorithm for the machine scheduling problem with job delivery coordination ⋮ Approximation algorithms for constructing required subgraphs using stock pieces of fixed length ⋮ Linear time-approximation algorithms for bin packing ⋮ Online results for black and white bin packing ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ On capacitated covering with unit balls ⋮ Offline black and white bin packing ⋮ NF-based algorithms for online bin packing with buffer and bounded item size
