Operation assignment and capacity allocation problem in automated manufacturing systems

Bilgin S., AZİZOĞLU M.

COMPUTERS & INDUSTRIAL ENGINEERING, vol.56, no.2, pp.662-676, 2009 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 56 Issue: 2
  • Publication Date: 2009
  • Doi Number: 10.1016/j.cie.2007.04.003
  • Journal Name: COMPUTERS & INDUSTRIAL ENGINEERING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.662-676
  • Middle East Technical University Affiliated: Yes

Abstract

We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that our Tabu Search procedure produces near optimal solutions very quickly. (C) 2007 Elsevier Ltd. All rights reserved.