A Bottleneck Degree-Based Migrating Birds Optimization Algorithm for the PCB Production Scheduling
To address the printed circuit board shop scheduling problem, a dynamic based on multi-indicator bottleneck degree is proposed to formulate this complex flexible job shop scheduling problem (FJSP). Then, a bottleneck degree-based migrating birds optimization algorithm (MBO) is proposed to tackle thi...
Main Authors: | Jun Cao, Zailin Guan, Lei Yue, Saif Ullah, Rehan Ahmad Khan Sherwani |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9235587/ |
Similar Items
-
Multi-Level Planning and Scheduling for Parallel PCB Assembly Lines Using Hybrid Spider Monkey Optimization Approach
by: Jabir Mumtaz, et al.
Published: (2019-01-01) -
A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems
by: Yingni Zhai, et al.
Published: (2014-10-01) -
Static and dynamic job-shop scheduling using rolling-horizon approaches and the Shifting Bottleneck Procedure
by: Ghoniem, Ahmed
Published: (2014) -
Estimation of the PCB Production Process Using a Neural Network
by: Kuo-Hsien Hsia, et al.
Published: (2019-08-01) -
Censuses and Observations from a Raptor Migration Bottleneck, Hatay Turkey: Phenology and Threats
by: İlker Özbahar, et al.
Published: (2018-10-01)