To maximize sales or profit given a fixed budget, direct marketing targets a preset top percentage of consumers who are the most likely to respond and purchase a greater amount. Existing forecasting models, however, largely ignore the resource constraint and render sup-optimal performance in maximizing profit given the budget constraint. This study proposes a model of partial order constrained ...

In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at the problem with only one resource. We show how to adapt the procedure by Van den Akker et al. [1] for the problem of minimizing maximum lateness on a set of identical, parallel machines such that it can be used to solv...

In this paper, we propose a joint power-distortion optimization scheme for real-time H.264 video encoding under the power constraint. Firstly, the power constraint is translated to the complexity constraint based on DVS technology. Secondly, a computation allocation model (CAM) with virtual buffers is proposed to facilitate the optimal allocation of constrained computational resource for each f...

W propose a cooperation method between constraint programming and integer programming to compute lower bounds for the resource-constrained project scheduling problem (RCPSP). The lower bounds are evaluated through linear-programming (LP) relaxations of two different integer linear formulations. Efficient resource-constraint propagation algorithms serve as a preprocessing technique for these rel...

In many domains, planning and scheduling problems have been considered separately. This historical decomposition leads to sub-optimal solving methods as task scheduling and planning share important sub-problems. In fact, on practical examples, there is no reason to separate coordination of activities and synchronization tasks. Furthermore, resource usage is not only relevant for task scheduling...

Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each m...