This article proposes a framework to model and reason on what we call multi-calendar appointment scheduling problems. Multicalendar appointment scheduling problems such as planning a phone conference of three persons in France, Tunisia, and Japan refer to various temporal conditions, involving arbitrary calendric types such as months (Islamic months are defined differently from Gregorian months...

With the advent of small cell networks (SCNs) to support growing wireless data volumes and thus reduced cell sizes, cooperative communications are significantly facilitated. Applicable to 3GPP LTE-A, we propose a novel channel/queue-aware user pairing and scheduling scheme in a cooperative virtual multiple-input multiple-output (VMIMO) system. The queueing performance of the VMIMO system with t...

The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal of research has investigated new stronger and faster filtering techniques for cumulative, but still most of these techniques only pay off in limited cases or are not scalable. Recently, the “lazy clause generation” hybrid solvin...

Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we describe how we can mimic a finite domain propagation engine, by mapping propagators into clauses in a SAT solver. This immediately results in strong nogoods for finite domain propagation. But a naive static translati...

Effective and efficient modeling and management of hardware resources have always been critical toward generating highly efficient code in optimizing compilers. The instruction templates and dispersal rules of the Itanium architecture add new complexity in managing resource constraints to instruction scheduler. We extended a finite state automaton (FSA) approach to efficiently manage all key re...

Under the assumption of outdated channel state information (CSI) at the source, we consider the finite blocklength (FBL) throughput of a two-hop relaying system. Previous work has considered this setting so far only for the infinite blocklength case, where decoding can be arbitrarily reliable as long as operating below the Shannon limit. In contrast, in the FBL regime residual decoding errors c...

Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments to finite-domain variables. Hybrid constraint tightening (HCT) reformulates hybrid constraints to apply the tightest consistent temporal bound possible, assisting in search space pruning. The contribution of this pape...

We introduce a comprehensive modeling framework for the problem of scheduling a finite number of finite-length jobs where the available service rate is time-varying. The main motivation comes from wireless data networks where the service rate of each user varies randomly due to fading. We employ recent advances on the restless bandit problem that allow to obtain an opportunistic scheduling rule...

In the Broadcast Scheduling Problem (BSP), a finite set of wireless stations are to be scheduled in a time division multiple access frame. The objective is to provide a collision free broadcast schedule which minimizes the total frame length and maximizes the slot utilization within the frame. We present a Greedy Randomized Adaptive Search Procedure (GRASP) for the BSP. GRASP is a two-phase met...