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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Boudhar, Mourad	-
dc.date.accessioned	2019-06-26T09:21:20Z	-
dc.date.available	2019-06-26T09:21:20Z	-
dc.date.issued	2019-03-05	-
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/20945	-
dc.description	Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019	en_US
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Université Kasdi Merbah Ouargla	en_US
dc.relation.ispartofseries	2019;	-
dc.subject	Open shop	en_US
dc.subject	set-up times	en_US
dc.subject	server	en_US
dc.subject	makespan	en_US
dc.subject	MIP model	en_US
dc.title	MIP models for a two-machine open shop problem and a server with set-up times	en_US
dc.type	Article	en_US
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