Related papers: Scheduling Problems
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in…
In the paper we consider the problem of scheduling $n$ identical jobs on 3 uniform machines with speeds $s_1, s_2,$ and $s_3$ to minimize the schedule length. We assume that jobs are subjected to some kind of mutual exclusion constraints,…
We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two complementary lenses: promise-aware complexity measures and…
Mapping functions on bits to Hamiltonians acting on qubits has many applications in quantum computing. In particular, Hamiltonians representing Boolean functions are required for applications of quantum annealing or the quantum approximate…
We study the problem of scheduling equal-length jobs with release times and deadlines, where the objective is to maximize the number of completed jobs. Preemptions are not allowed. In Graham's notation, the problem is described as…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
We study the problem of non-preemptively scheduling $n$ jobs, each job $j$ with a release time $t_j$, a deadline $d_j$, and a processing time $p_j$, on $m$ parallel identical machines. Cieliebak et al. (2004) considered the two constraints…
We present a review of the most important results in the theory of symmetric functions in superspace (or symmetric superpolynomials), summarizing all principal contributions since its introduction in 2001 in the context of the…
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as…
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of…
One approach to probabilistic inference involves counting the number of models of a given Boolean formula. Here, we are interested in inferences involving higher-order objects, i.e., functions. We study the following task: Given a Boolean…
Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
Scheduling is essentially a decision-making process that enables resource sharing among a number of activities by determining their execution order on the set of available resources. The emergence of distributed systems brought new…
In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of…
This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…
Characteristic quasi-polynomials are the enumerative functions counting the number of elements in the complement of hyperplane arrangements modulo positive integers. A notable phenomenon in this context is period collapse, where the…
Chemotherapy appointment scheduling is a challenging problem due to the uncertainty in pre-medication and infusion durations. In this paper, we formulate a two-stage stochastic mixed integer programming model for the chemotherapy…
We establish a new description of the Schur-Agler norm of a holomorphic function on the polydisc as the solution of a convex optimization problem. Consequences of this description are explored both from a theoretical and from a practical…
This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…