A Mixed Integer Linear Programming Approach for Multi-Degree Cyclic Multi-Hoist Scheduling  

Oleh:

Li, Xin ; Fung, Richard Y. K.

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-7.
Topik: Multi-Hoist Scheduling Problem; Multi-Degree Cycle; Mixed Integer Linear Programming; Scheduling & Sequencing.
Fulltext: 1288.pdf (604.26KB)

Isi artikel

Automated electroplating lines are integrated systems for printed circuit board (PCB) production. Hoists are used as material handling devices. Scheduling automated electroplating lines are known as hoist scheduling problems. Printed circuit boards are called parts. Parts are processed in tanks with processing time windows. Moreover, there are no buffers between tanks. These conditions make hoist scheduling problems much more challenging. Usually, identical parts are scheduled to be produced in a line during a given period. Cyclic scheduling is applied for easy simply implementation. This paper considers multi-degree cyclic hoist scheduling problems with multiple hoists. The objective is to minimize the cycle time at the steady state, hence maximizing the throughput of the line. There are three typical types of constraints in cyclic hoist scheduling problems: hoist available constraints, tank capacity constraints and time window constraints. In addition, hoist collision avoidance constraints also should be guaranteed in lines with multiple hoists. In order to obtain optimal cyclic schedules of lines with multiple hoists, a mixed integer linear programming approach is applied to model the scheduling problem in this paper. Finally, a numerical example is used to illustrate the model proposed.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali