In past 5 decades flow shop
scheduling may be a challenging area for researchers.
The cut tobacco processing resembles flow shop
processing in that all inputs are manufactured along duplicate production lines.
In a typical hybrid flow shop
scheduling (HFS) problem (Figure 1), a set of n jobs need to be processed through M production stages and at each stage k there are [m.
The complexity of flow shop
and job shop scheduling.
The formal description to the flow shop
with batch processing machines considered in this paper is as follows.
Most of the research done so far is on static scheduling problems and especially on single machine / flow shop
bi-criteria static scheduling problems.
Zeng  also used a 3-stage hybrid flow shop
to simulate the operating system of container terminals, and adopted simulation optimization to solving the integrated scheduling problem.
According to MacCarthy and Liu (1993) and Baker (1974), Flow Shop
is a type of process where all tasks have a similar flow pattern, that is, they have the same processing schedule on all resources and the number of resources in each stage of production equals one.
SOLVING THE FLEXIBLE FLOW SHOP
PROBLEM USING THE CHU-BEASLEY'S GENETIC ALGORITHM
LSM and TCM can be also considered as the permutation flow shop
scheduling problem described as follows.
Currently, his research interests are manufacturing information, job shop scheduling, flow shop
scheduling and computer aided engineering.
Other subjects include flexible flow shop
scheduling by intelligence multi-agents, operational semantics for ASSL, and extending the UML metamodel to provide support for crosscutting concerns.