Applications of Hybrid flowshop schedulings under dynamic constraints of queue time and capacities

This paper introduced the hybrid flowshop scheduling (HFS) for a production system including Q-time restrictions or products with individual due-dates such as Make-to-Order products. Two of Gupta's algorithms for 2-step and for n-step hybrid flowshop problem (2010) were extended to consider with the restrictions of queueing time. Those are denoted by Extended-Gupta (2) and Extended-Gupta (n) here. As the result of performance evaluations using actual conditions of target production systems, Both of the Extended algorithms much improved the utilization of machines without deterioration of the due-date satisfaction rate, though ordinal dispatching rules or the original Gupta algorithm results lower utilization or lower due-date satisfaction rate. Extended-Gupta (n) performs better than Extended-Gupta (2) because of its total optimization ability.