Bin packing with restricted piece sizes

DOI10.1016/0020-0190(89)90223-8zbMath0684.68055OpenAlexW2080459789MaRDI QIDQ1825652

Joseph Y.-T. Leung

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90223-8

zbMATH Keywords

strongly NP-hardmultiprocessor scheduling problem\(\epsilon \) -approximation schemebin-packing problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (6)

New Algorithmic Results for Bin Packing and Scheduling ⋮ An APTAS for bin packing with clique-graph conflicts ⋮ An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension ⋮ Closing the Gap for Makespan Scheduling via Sparsification Techniques ⋮ On minimizing the makespan when some jobs cannot be assigned on the same machine ⋮ A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Cites Work

• Unnamed Item
• Unnamed Item
• Bin packing with divisible item sizes
• Bin packing: Maximizing the number of pieces packed
• Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
• On a dual version of the one-dimensional bin packing problem
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Application of Bin-Packing to Multiprocessor Scheduling

This page was built for publication: Bin packing with restricted piece sizes