Optimization models for the tool change scheduling problem

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 wi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Omega (Oxford) Ročník 36; číslo 5; s. 888 - 894
Hlavní autor: Chen, Jen-Shiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Exeter Elsevier Ltd 01.10.2008
Elsevier
Elsevier Science Publishers
Pergamon Press Inc
Edice:Omega
Témata:
Analysis
Applied sciences
Availability constraints
Exact sciences and technology
Integer programming
Job shops
Mathematical optimization
Mathematical programming
Methods
Operational research and scientific management
Operational research. Management science
Optimization
Production management
Production scheduling
Scheduling
Scheduling Tool change Integer programming Tardiness Availability constraints
Scheduling, sequencing
Studies
Tardiness
Tool change
United States
Integer programming
Scheduling
Availability constraints
Tool change
Tardiness
Availability
Production system
Work period
Replacement problem
Machining
Mixed integer programming
Continuous time
Modeling
Optimization
Delay
Tool life
Machine tool
Tool wear
Single machine
ISSN:0305-0483, 1873-5274
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2006.04.006