Non-identical parallel CNC machine scheduling

Date
2003
Authors
Türkcan, A.
Selim Aktürk, M.
Storer, R. H.
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
International Journal of Production Research
Print ISSN
0020-7543
Electronic ISSN
1366-588X
Publisher
Taylor & Francis
Volume
41
Issue
10
Pages
2143 - 2168
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
Abstract

In this study, we solve the non-identical parallel CNC machine scheduling problem. We have two objectives: minimizing the manufacturing cost (comprising machining, non-machining and tooling costs) and minimizing the total weighted tardiness. The tooling constraints affect the non-machining times as well as the machining conditions, such as cutting speed and feed rate, which in turn specify the machining times and tool lives. We propose a two-stage algorithm to find optimal machining conditions and to determine machine allocation, tool allocation and part scheduling decisions. The proposed algorithm generates different schedules according to the relative importance of the objectives.

Course
Other identifiers
Book Title
Keywords
Algorithms, Computational methods, Decision making, Flexible manufacturing systems, Heuristic methods, Scheduling, Machine allocation, Machining
Citation
Published Version (Please cite this version)