Minimizing the Number of Tardy Jobs in a Flowshop

摘要

The aim of this paper is to propose an effective heuristic and a exact method for a scheduling problem. The workshop is an hybrid flowshop, and the problem is to perform jobs between a release date and a due date, in order to minimize the number of tardy jobs. A linear programming formulation of the problem is proposed as an exact method. A greedy algorithm and a genetic algorithm are proposed as approximate methods. To evaluate these methods, experiments on instances like industrial ones are computed.