Abstract
We consider a machining center that consists of a loading/unloading station, a CNC machine station, and a rotary table, which is the material handling device that moves jobs between these two stations simultaneously. Given a set of jobs that need to be processed on the machining center, the objective of the problem is to find the job sequence that minimizes the makespan. In this paper, a 0-1 mixed-integer linear programming model for this problem is presented. In addition, a heuristic algorithm is proposed to obtain near-optimal solutions for large-scale versions of the problem. Computational results are also provided.
Original language | English (US) |
---|---|
Pages | 575-580 |
Number of pages | 6 |
State | Published - 2012 |
Event | 62nd IIE Annual Conference and Expo 2012 - Orlando, FL, United States Duration: May 19 2012 → May 23 2012 |
Other
Other | 62nd IIE Annual Conference and Expo 2012 |
---|---|
Country/Territory | United States |
City | Orlando, FL |
Period | 5/19/12 → 5/23/12 |
All Science Journal Classification (ASJC) codes
- Industrial and Manufacturing Engineering