Scheduling of jobs in some production system

摘要

We consider a real-life problem of scheduling clients orders in the production of concrete blocks in a factory of building industry. This problem can be modelled as hybrid flow shop scheduling problem with mixed no waito store constraints and mixed bottleneckon-bottleneck machines. The objective function is to minimize maximum completion time. To solve the problem, we propose an approximation algorithm based on the tabu search approach.