期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 52, 期 2, 页码 210-228出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2006.12.004
关键词
late work criterion; shop scheduling; flexible manufacturing system; branch and bound algorithm
The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznan University of Technology. A short description of the production environment, which can be modeled as the extended job shop system with open shop sections within particular jobs, is followed by the proposition of a branch and bound method. It optimizes production plans within a single shift in order to minimize the late work, i.e. the amount of work executed after a given due date. Based on results of computational experiments, conclusions are formulated on the efficiency of the B&B algorithm and on the behavior of FMS under consideration. (c) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据