Assembly Line Balancing Problem with Stochastic Sequence-Dependent Setup Times

A nondominated sorting ant colony optimization algorithm for complex assembly line balancing problem incorporating incompatible task sets

“…While this does not mean that NSACO outperforms SA, it clearly shows the powerful solution building capacity of NSACO and the nondominated sorting solution methodology proposed in this research. When the [ ] 3 values are compared to , it is observed that NSACO obtains optimal solutions for P9, P12, P16, P20, P24, P36 and P65. For P148, the solution found by NSACO requires one more workstation than the theoretical lower bound while this does not always mean that the solution is not optimal.…”

“…is the lower bound of [ ] 3 under the condition that the cycle time is . is calculated using the formulae provided by Ozcan and Toklu [22] It should be noted here that Ozcan and Toklu [22] have not handled the MTALBP with the aim of optimising cycle time as well as the number of workstations.…”

“…There are essential constraints which must be ensured during the balancing process, i.e. assignment constraint, capacity constraint and precedence relationship constraint [3]. Assembly line balancing problems can be classified as type-I, type-II and type-E based on the performance criterion, or objective, sought.…”

Elektronik kart üretiminde hat atama problemi için süreç akışını dikkate alan bütünleşik bir yaklaşım

“…Elektronik kart üretiminde müşteri taleplerine karşılık verebilmek için üretim planlarının "yüksek çeşit -düşük üretim" özelliğine sahip şekilde yapılması gerekmektedir. Bu durum ise hazırlık sürelerinde artışa [9] ve kapasite kullanım oranlarında azalmaya neden olmaktadır. Hem makinelerin kapasite kullanım oranlarını artırmak hem de hazırlık sürelerinin azalmasını sağlamak amacıyla yapılan çalışmalara ihtiyaç duyulmaktadır [10].…”