A Second Order-Cone Programming Relaxation for Days-Off Scheduling Problem

dc.contributor.author	ISTRATI, Daniela
dc.contributor.author	MORARU, Vasile
dc.contributor.author	ZAPOROJAN, Sergiu
dc.date.accessioned	2022-04-13T06:58:16Z
dc.date.available	2022-04-13T06:58:16Z
dc.date.issued	2021
dc.identifier.citation	ISTRATI, Daniela, MORARU, Vasile, ZAPOROJAN, Sergiu. A Second Order-Cone Programming Relaxation for Days-Off Scheduling Problem. In: International Conference on Electronics, Communications and Computing: proc. IC ECCO, 21-22 Oct. 2021, Chişinău. Republica Moldova, 2021, pp. 182-186. ISBN 978-9975-4264-8-0.	en_US
dc.identifier.isbn	978-9975-4264-8-0
dc.identifier.uri	https://doi.org/10.52326/ic-ecco.2021/CS.05
dc.identifier.uri	http://repository.utm.md/handle/5014/20095
dc.description.abstract	This paper relates the numerical solution of one of the well-known problems related to production systems. Namely, it is about Days-Off Scheduling Problem, which is reformulated in terms of non-convex minimization problems with quadratic constraints. After relaxation of the above problem, a model based on second-order cone programming is obtained.	en_US
dc.language.iso	en	en_US
dc.publisher	Technical University of Moldova	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	days off scheduling	en_US
dc.subject	binary quadratic programming	en_US
dc.subject	minimization problems	en_US
dc.title	A Second Order-Cone Programming Relaxation for Days-Off Scheduling Problem	en_US
dc.type	Article	en_US