Cyclic flow shop scheduling problem with two-machine cells

Abstract

In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.

A Parallel Algorithm for Scheduling a Two-Machine Robotic Cell in Bicycle Frame Welding Process

“…Two-level metaheuristics were successfully used to solve scheduling problems [11,12]. Alternatively, one can solve the first level conventionally and treat the second level as the so-called very large-scale neighborhood [13,14].…”

“…For a given assignment P ∈ P, it was shown in [12], that the minimal cycle time T(P) for which a feasible schedule exists equals…”

“…A sequential, exact algorithm for CAP was proposed in [12]. Unfortunately, despite the polynomial computational complexity, its execution time for CAP instances with a large number of jobs may be unacceptable in practice.…”

Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings

“…For example, the authors of [3] considered a cyclic variant, where the initial set of jobs (called Minimal Part Set) is scheduled repeatedly in a cycle with the goal to minimize the cycle time. Another cyclic variant of FSSP, where machines are replaced by single-operator robotic cells, was researched in [4]. Due to the nature of real-life production processes, another common FSSP variant is based on consideration of uncertainty in the data, as shown in [5].…”

“…This critical path is composed of three blocks (one for each machine). On the first machine, we have a 4-operation R-block beginning at operation (1, 1) and ending at operation (1,4). On the second machine, we have an L-block of size 3 starting at operation (2, 3) and going back to operation (2, 1).…”