Paper Info
Title
A column generation heuristic for complex job shop multiple orders per job scheduling
Abstract
Scheduling in semiconductor manufacturing is a challenging task due to inherent complexities like assignment of multiple customer orders to front opening unified pods (FOUPs), batch processing in multiple toolgroups with parallel machines, and re-entrant flow. A disjunctive-network-flow mixed integer program (DNF) and a column generation heuristic are presented to minimize the sum of weighted customer order completion times in a complex job shop environment. In addition, a lower bound estimation approach for the complex job shop problem is presented. The column generation heuristic obtains solutions that are very close to that of the time constrained DNF formulation for problem instances with zero order ready times. However, column generation's performance differs considerably for problem instances with non-zero order ready times and is able to solve large problem instances in a matter of minutes.
Year
DOI
Venue
2010
10.1016/j.cie.2009.09.004
Computers & Industrial Engineering
Keywords
Field
DocType
network flow,ready time,non-zero order,integer programming,column generation heuristic,complex job shop problem,column generation,multiple customer order,weighted customer order completion,scheduling,job scheduling,problem instance,multiple order,column generation heuristic obtains,large problem instance,optimization,batch process,semiconductor manufacturing,lower bound
Column generation,Heuristic,Mathematical optimization,Job shop scheduling,Computer science,Job shop,Flow shop scheduling,Integer programming,Batch processing,Job scheduler,Operations management
Journal
Volume
Issue
ISSN
58
1
Computers & Industrial Engineering
Citations 
PageRank 
References 
2
0.44
3
Authors
2
Name
Order
Citations
PageRank
Jagadish Jampani1141.66
Scott J. Mason255573.37