Optimization models for the tool change scheduling problem |
| |
Authors: | Jen-Shiang Chen |
| |
Institution: | Department of Industrial and Business Management, Far East College, 49 Junghua Road, Shinshr Shiang, Tainan 744, Taiwan, ROC |
| |
Abstract: | 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 TL (tool life) and the tool change time is TC. 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. |
| |
Keywords: | Scheduling Tool change Integer programming Tardiness Availability constraints |
本文献已被 ScienceDirect 等数据库收录! |
|