Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parameterized on-line open-end bin packing

From MaRDI portal
Publication:1387710
Jump to:navigation, search

DOI10.1007/BF02684336zbMath0903.90104MaRDI QIDQ1387710

Guo-Chuan Zhang

Publication date: 8 June 1998

Published in: Computing (Search for Journal in Brave)


zbMATH Keywords

on-line algorithmsbin packingasymptotic worst-case performance ratio


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)


Related Items (9)

On various open-end bin packing game ⋮ Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Online minimization of the maximum starting time: migration helps ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Hardness of lazy packing and covering ⋮ Starting time minimization for the maximum job variant ⋮ More on ordered open end bin packing ⋮ On lazy bin covering and packing problems




Cites Work

  • Unnamed Item
  • On a dual version of the one-dimensional bin packing problem
  • A note on an open-end bin packing problem




This page was built for publication: Parameterized on-line open-end bin packing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1387710&oldid=13542509"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki