Siu-chung Lau1, Gilbert H. Young2, W. K. Kan1, Yu-Liang Wu1
1Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong.
2Department of Computing, The Hong Kong Polytechnic University, Hong Keng.
Abstract:

Classical bin packing has been studied extensively in the literature. Open-ends bin packing is a variant of the classical bin packing. Open-ends bin packing allows pieces to be partially beyond a bin, while the classical bin packing requires all pieces to be completely inside a bin. We investigate the open-ends bin packing problem for both the off-line and on-line versions and give algorithms to solve the problem for parametric cases.

E-mail Alert

Add your e-mail address to receive upcoming issues of Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;