Optimization models for the tool change scheduling problem

Chen, Jen-Shiang

doi:10.1016/j.omega.2006.04.006

Return

Optimization models for the tool change scheduling problem

2008-10-01

PRE

Chen, Jen-Shiang *

DOI：10.1016/j.omega.2006.04.006

Original

Original request for help

Save

Abstract

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.

Keywords:

scheduling

tool change

integer programming

tardiness

availability constraints

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.