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


Single machine scheduling with batch deliveries
Institution:1. School of Science, Nanjing University of Science and Technology, Nanjing, Jiangsu 210094, People’s Republic of China;2. School of Automobile and Traffic Engineering, Jiangsu University of Technology, Changzhou, Jiangsu, 213001, People’s Republic of China
Abstract:The single machine batch scheduling problem is studied. The jobs in a batch are delivered to the customer together upon the completion time of the last job in the batch. The earliness of a job is defined as the difference between the delivery time of the batch to which it belongs and its completion time. The objective is to minimize the sum of the batch delivery and job earliness penalties. A relation between this problem and the parallel machine scheduling problem is identified. This enables the establishment of complexity results and algorithms for the former problem based on known results for the latter problem.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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