|Title:||A flow shop sequencing problem with synchronous material transfers||Authors:||Mendoza, Abraham
Ventura, José A.
|Keywords:||Flow shop scheduling | Heuristic algorithm | Makespan | Synchronous material movement||Issue Date:||1-Jan-2012||Start page/Pages:||575||Source:||62nd IIE Annual Conference and Expo 2012||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.
|Appears in Collections:||工業工程學研究所|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.