Online over time processing of combinatorial problems
type: Item
instance of: scholarly article
title: Online over time processing of combinatorial problems
zbMATH Open document ID: 1402.90145
author: Robinson Duque
author: Alejandro Arbelaez
author: Juan Francisco Díaz
published in: Constraints
publication date: 2018-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6974975
zbMATH Keywords: online scheduling
zbMATH Keywords: combinatorial problems
zbMATH Keywords: machine learning
zbMATH Keywords: regression models
zbMATH Keywords: classification models
zbMATH Keywords: runtime estimation
zbMATH Keywords: mixed integer programming
MaRDI profile type: Publication
full work available at URL: s10601-018-9287-4
OpenAlex ID: W2800805831
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Q4420522
cites work: Random forests
cites work: On-line scheduling of parallel jobs on two machines
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
cites work: Online scheduling of parallel jobs on two machines is 2-competitive
cites work: Algorithm runtime prediction: methods \& evaluation
cites work: Empirical hardness models
cites work: Scheduling
cites work: Discovering the suitability of optimisation algorithms by learning from evolved instances
cites work: Q4420517
cites work: Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems
cites work: Online over time scheduling on parallel-batch machines: a survey
cites work: Mixed integer linear programming formulation techniques
Wikidata QID: Q129872445
DOI: 10.1007/S10601-018-9287-4
description: scientific article; zbMATH DE number 6974975