MATHEMATICAL PROGRAMMING FORMULATIONS FOR HYBRID FLOW SHOP SCHEDULING WITH PARALLEL MACHINES AT THE FIRST STAGE AND TWO DEDICATED MACHINES AT THE SECOND STAGE

摘要

in this article two mathematical models and lower bounds are presented for the hybrid flow shop scheduling problem noted HFS. We consider m_e parallel machines at the first stage and two dedicated machines at the second stage. We showed that the performance depends on the choice of the decision variable types.