Production and scheduling system in the flow shop

The sequencing problem is very popular and occurs whenever plural jobs are to be assigned to machines or workers. In fact, when we make a production schedule, we cannot avoid this problem, whether the production system is an open shop or a closed shop, single-stage or multi-stage. Recently a spotlight has been focused upon developing heuristic methods which are practical as well as economic for sub-optimal solutions because the sequencing problem has proved to be categorized in a large group of hard combinatorial problems. This paper does not present a new theoretical approach in the production scheduling problem, but introduces an interesting and successful case in applying the heuristic methodology to a real-life flow shop environment.