Publication:
Parallel machine scheduling with tool loading

Placeholder

Departments

School / College / Institute

Organizational Unit
GRADUATE SCHOOL OF BUSINESS
Upper Org Unit

Program

KU-Authors

KU Authors

Co-Authors

Özpeynirci, Selin
Hnich, Brahim

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This paper presents a mixed integer programming approach that integrates the tool assignment and scheduling problems arising in parallel machine environments. There are a number of operations to be processed on parallel machines. Each operation requires a set of tools; however, the number of available tools are limited. Our objective is to minimize the makespan, i.e. the completion time of the final operation. We propose two different mathematical programming models for this problem. Since the problem is strongly NP hard in general, finding the optimal solution requires extremely long computational times as the problem size increases. We therefore develop a tabu search algorithm in order to find near-optimal solutions within reasonable times. (C) 2016 Elsevier Inc. All rights reserved.

Source

Publisher

Elsevier Science Inc

Subject

Engineering, Mathematics, Mechanics

Citation

Has Part

Source

Applied Mathematical Modelling

Book Series Title

Edition

DOI

10.1016/j.apm.2016.01.006

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details