.png){kind=icon}
返回
Optimization models for the tool change scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2006.04.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
scheduling
tool change
integer programming
tardiness
availability constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏