We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
Carina Pimentel, Filipe Pereira Alvelos, Antonio D...