Online over time processing of combinatorial problems

In an online environment, jobs arrive over time and there is no information in advance about how many jobs are going to be processed and what their processing times are going to be. In this paper, we study the online scheduling of Boolean Satisfiability (SAT) and Mixed Integer Programming (MIP) inst...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Constraints : an international journal Ročník 23; číslo 3; s. 310 - 334
Hlavní autoři:	Duque, Robinson, Arbelaez, Alejandro, Díaz, Juan F.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.07.2018 Springer Nature B.V Springer Verlag
Témata:	Artificial Intelligence Boolean algebra Combinatorial analysis Completion time Computer Science Integer programming Interruption Lateness Linear programming Machine learning Mixed integer Operations Research Operations Research/Decision Theory Optimization Production scheduling Scheduling Topical Collection on Integration of Constraint Programming Regression models Runtime estimation Online scheduling Machine learning Combinatorial problems Mixed integer programming Classification models Mixed Integer Programming Constraint Programming SAT Problem
ISSN:	1383-7133, 1572-9354
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!