This paper presents a literature review on the m-machine flow shop scheduling problem with
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …

This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …

With the continuous development of national economies, problems of various energy
consumption levels and pollution emissions in manufacturing have attracted attention from …

With the advent of cloud manufacturing (CMfg), more and more services in CMfg platforms
may provide the same functionality but differ in performance. In order to insure the …

Scheduling problems play an increasingly significant role in the design and optimization of
highly computerized and automated production systems. Given the importance of just-in …

This paper presents a high performing Discrete Artificial Bee Colony algorithm for the
blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we …

In this research, flexible flow shop scheduling with unrelated parallel machines at each
stage are considered. The number of stages and machines vary at each stage and each …

This paper proposes two constructive heuristics, ie HPF1 and HPF2, for the blocking flow
shop problem in order to minimize the total flow time. They differ mainly in the criterion used …

Cloud manufacturing (CM) is a new type of networked manufacturing model, which is
proposed in 2010. Optimization technology is one of the key techniques for CM operation …

This paper focuses on the blocking flow shop scheduling problem with the objective of total
flowtime minimisation. This problem assumes that there are no buffers between machines …