We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. We consider two objectives: minimizing the number of late tasks, and minimizing total tardiness. Our main theoretical contribution is...

We present a bandwidth allocation scheme offering optimal solutions to the network optimization problem. The bandwidth allocation policy in class-based networks can be defined with the proportionally fair rule expressed by piecewise linear objective functions. This scheme is formulated as a mixed-integer linear programming (MILP) model, preparing a database identifying suitable paths upon each ...

Branch and bound algorithms for Mixed-Integer Linear Programming (MILP) almost universally branch on a single variable to create disjunctions. General linear expressions involving multiple variables are another option for branching disjunctions, but are not used for two main reasons: (i) descendent LPs tend to solve more slowly because of the added constraints, so the overall solution time is i...

Optimizing scheduling is an effective way to improve the profit of refineries; it usually requires accurate models to describe the complex and nonlinear refining processes. However, conventional nonlinear models will result in a complex mixed integer nonlinear programming (MINLP) problem for scheduling. This paper presents a piecewise linear (PWL) modeling approach, which can describe global no...

Network Function Virtualization (NFV) allows multiple Virtual Networks (VNs) to share the underlying physical infrastructure via VN mapping, thus improving the utilization of physical resources. In this paper, for the first time, we study the multicast service-oriented VN mapping that can support big data applications over Elastic Optical Networks (EONs). We first formulate the problem of minim...

preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...

with the aim of reducing cost of electricity consumption and peak load reduction, tools requirement for better managing electricity consumption have become inevitable in recent years. smart home has some equipment which are controllable and this ability is used for increasing comfort and minimizing electricity cost for residence. as a key component of smart home , electric vehicle(ev) ,increase...

The profound transformation of large-scale Industrial Control Systems (ICS), e.g., smart energy networks (Smart Grids), from a proprietary and isolated environment to a modern architecture brings several new challenges. Nowadays, ICS network designers need to accommodate a variety of devices and communication media/protocols with industry-specific requirements pertaining to real-time delivery o...

Channel routing is a type of problems arising in the detailed routing phase of VLSI physical design automation as well as in the design of printed circuit boards (PCBs). It has been known that channel routing problems can be formulated as constraint programming (CP) problems and thus CP solvers can be used to find solutions. In this article, we present a mixed integer linear programming (MILP) ...

Many hybrid systems can be conveniently modeled as Piecewise Affine Discrete Time Hybrid Systems PA-DTHS. As well known Bounded Model Checking (BMC) for such systems comes down to solve a Mixed Integer Linear Programming (MILP) feasibility problem. We present a SAT based BMC algorithm for automatic verification of PA-DTHSs. Using Counterexample Guided Abstraction Refinement (CEGAR) our algorith...