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


Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
Institution:1. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, PR China;2. School of Mechanical Engineering, Tongji University, Shanghai 201804, PR China
Abstract:In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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