Online over time processing of combinatorial problems

DOI10.1007/s10601-018-9287-4zbMath1402.90145OpenAlexW2800805831WikidataQ129872445 ScholiaQ129872445MaRDI QIDQ1617394

Alejandro Arbelaez, Robinson Duque, Juan Francisco Díaz

Publication date: 8 November 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-018-9287-4

zbMATH Keywords

combinatorial problemsmixed integer programmingregression modelsmachine learningonline schedulingclassification modelsruntime estimation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Online over time scheduling on parallel-batch machines: a survey
• Algorithm runtime prediction: methods \& evaluation
• Online scheduling of parallel jobs on two machines is 2-competitive
• On-line scheduling of parallel jobs on two machines
• Mixed Integer Linear Programming Formulation Techniques
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Empirical hardness models
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Scheduling
• Random forests

This page was built for publication: Online over time processing of combinatorial problems