Particle Swarm Optimization Based On Bottleneck Machine For Jobshop Scheduling  

Oleh:

Maulidya, Rahmi

Jenis: Article from Proceeding
Dalam koleksi: Proceeding The 7th International Seminar on Industrial Engineering and Management (7th ISIEM) di Bali, March 11th – 13th, 2014, page PS 100-104.
Topik: scheduling; job shop; bottleneck; Particle Swarm Optimization; due date; makespan
Fulltext: Paper 78 Rahmi Maulidya Trisakti University.pdf (230.92KB)

Isi artikel

In job shop production system, bottleneck machine is treated as a center of production planning so it is important to maximize the production capacity. Bottleneck scheduling problem divided solution into forward and backward scheduling. The completion time of the job until bottleneck machine is a due date for all job and the completion time of the job after bottleneck machine is the real completion time for all job. In most scheduling problem, solution using Particle Swarm Optimization is only to minimize makespan in forward scheduling or minimize the number of tardy job in backward scheduling. This research present the methodology to solve job shop scheduling problem based on bottleneck machine using Particle Swarm Optimization

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali