Abstract 

 

Abstract—In this paper, we are addressing the two-machine open shop problem with a single sever. A job must be prepared by the server and then will directly be processed on a machine. We show the N P-completeness in the strong sense of a restricted case. Then, we propose two mixed integer programming formu- lations to solve the general problem. Finally, we analyze their performance by an experimental study we conducted.

 

 

 Télécharger l'article : MIP models for a two-machine open shop problem and a server with set-up times