Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops

Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops

Scheduling decisions are of certain cachet in production and operations management. Many extensions are developed to help address different scheduling industrial situations, one of which, the Mixed-Blocking Permutation Flowshop Scheduling Problem (MBPFSP), has gained recent recognition due to its wi...

Full description

Bibliographic Details
Main Authors: Chen-Yang Cheng, Shih-Wei Lin, Pourya Pourhejazy, Kuo-Ching Ying, Jia-Wen Zheng
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Scheduling
permutation flowshop
mixed-blocking
metaheuristics
Online Access:https://ieeexplore.ieee.org/document/9157850/

Internet

https://ieeexplore.ieee.org/document/9157850/

Similar Items