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...

Full description

Saved in:

Bibliographic Details
Published in:	Constraints : an international journal Vol. 23; no. 3; pp. 310 - 334
Main Authors:	Duque, Robinson, Arbelaez, Alejandro, Díaz, Juan F.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2018 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!