MIP models for a two-machine open shop problem and a server with set-up times

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/20945

Title:	MIP models for a two-machine open shop problem and a server with set-up times
Authors:	Boudhar, Mourad
Keywords:	Open shop set-up times server makespan MIP model
Issue Date:	5-Mar-2019
Publisher:	Université Kasdi Merbah Ouargla
Series/Report no.:	2019;
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.
Description:	Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019
URI:	http://dspace.univ-ouargla.dz/jspui/handle/123456789/20945
Appears in Collections:	2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:

File	Description	Size	Format
Mourad Boudhar.pdf		576,2 kB	Adobe PDF	View/Open

DSpace JSPUI