A note on an open-end bin packing problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A note on an open-end bin packing problem

Published:2001 Issue:4 Volume:4 Page:201-207
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J. Sched.

Author:

Leung Joseph Y.-T.,Dror Moshe,Young Gilbert H.

Publisher

Wiley

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Reference11 articles.

1. Approximation algorithms for bin packing: a survey. In Approximation Algorithms for NP-hard Problems, (ed.). PWS Publishing Company, 1996.

2. Bin packing with overlaps: the stacking dishes case. Working paper, 1979.

3. On a dual version of the one-dimensional bin packing problem

4. An efficient approximation scheme for the one-dimensional bin packing problem. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society: Long Beach, CA, 1982; 312-320.

5. Improved bounds for harmonic-based bin packing algorithms

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online Minimization of the Maximum Starting Time: Migration Helps;Algorithmica;2023-01-26

2. Open-end bin packing: New and old analysis approaches;Discrete Applied Mathematics;2022-11

3. Starting time minimization for the maximum job variant;Discrete Applied Mathematics;2022-01

4. More on ordered open end bin packing;Journal of Scheduling;2021-11-04

5. On Various Open-End Bin Packing Game;Combinatorial Optimization and Applications;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP