首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Maximum lateness minimization in one-dimensional bin packing
Institution:1. Dipartimento di Scienze/Ingegneria dell׳Informazione e Matematica, Università degli Studi dell׳Aquila, Via Vetoio, Coppito, I-67010 L׳Aquila, Italy;2. Dipartimento di Ingegneria dell׳Informazione, Università Politecnica delle Marche, Via Brecce Bianche, I-60131 Ancona, Italy;1. School of Science, Sichuan University of Science and Engineering, Zigong 643000, China;2. Department of Mathematics, Nanchang University, Nanchang 330031, China;3. Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing 100080, China;1. School of Management, University of Science and Technology of China, Hefei, Anhui Province 230026, PR China;2. Hefei University of Technology, Hefei, Anhui Province 230026, PR China;3. Schulich School of Business, York University, 4700 Keele Street, Toronto, Ontario, Canada M3J 1P3;1. Faculty of Science, Ningbo University, Ningbo 315211, PR China;2. School of Management Science and Engineering, Dongbei University of Finance and Economics, Dalian 116025, PR China;1. Department of Production Network Planning, Daimler Trucks, DE-70546 Stuttgart, Germany;2. TUM School of Management, Technische Universität München, Arcisstrasse 21, DE-80333 Munich, Germany
Abstract:
Keywords:One-dimensional bin packing  Scheduling  Mixed Integer programming  Integer reformulation
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号