| Articolul precedent |
| Articolul urmator |
 |
 273 2 |
| Ultima descărcare din IBN: 2023-06-16 21:27 |
 SM ISO690:2012ISTRATI, Daniela, MORARU, Vasile, ZAPOROJAN, Sergiu. A Second Order-Cone Programming Relaxation for Days-Off Scheduling Problem. In: Electronics, Communications and Computing: IC|ECCO-2021, Ed. 11, 21-22 octombrie 2021, Chişinău. Chișinău, Republica Moldova: Technical University of Moldova, 2021, Editia 11, pp. 182-186. ISBN 978-9975-45-776-7. DOI: https://doi.org/10.52326/ic-ecco.2021/CS.05 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Electronics, Communications and Computing Editia 11, 2021 |
||||||
|
Conferința "Electronics, Communications and Computing" 11, Chişinău, Moldova, 21-22 octombrie 2021 | ||||||
|
||||||
| DOI:https://doi.org/10.52326/ic-ecco.2021/CS.05 | ||||||
| Pag. 182-186 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie days-off scheduling, binary quadratic programming, days-off scheduling, style, styling (key words) |
||||||
|
|
|
|
