期刊
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
卷 36, 期 5, 页码 888-894出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2006.04.006
关键词
scheduling; tool change; integer programming; tardiness; availability constraints
Traditional machine scheduling literature generally assumes that a machine is available at all times. Yet this assumption may not be accurate in real manufacturing systems. In many cases, a machine's tool must be changed after it has continuously worked for a period of time. This paper deals with a single machine scheduling problem subject to tool wear, given the allowed maximum continuous working time of the machine is T-L (tool life) and the tool change time is T-C. Job processing and tool changes are scheduled simultaneously. In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem. Computational experiments are performed to evaluate the models' efficiency. (C) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据