design of a logistics network in proper way provides a proper platform for efficient and effective supply chain management. this paper studies a multi-period, multi echelon and multi-product integrated forward-reverse logistics network under uncertainty. first, an efficient complex mixed-integer linear programming (milp) model by considering some real-world assumptions is developed for the inte...

We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However, a commonly-encountered instance of this problem (m = 2) can be solved in polynomial time. For the general case (m > 2), we present a mixed-integer linear programming (MILP) model for ...

This paper presents a multi-week mixed integer linear programming (MILP) scheduling model for an ice cream processing facility. The ice cream processing is a typical complex food manufacturing process and a simplified version of this processing has been adapted to investigate scheduling problems in the literature. Most of these models only considered the production scheduling for a week. In thi...

We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...

We first introduce a novel modeling framework, called linear coupled component automata (LCCA), to facilitate the modeling of discrete-continuous dynamical systems with piecewise constant derivatives. Second, we provide a procedure for transforming models in this framework to mixed-integer linear programming (MILP) constraints. Traditionally, such systems have been modeled directly with MILP co...

OBJECTIVE To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. DESIGN Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear Programming (MILP) model. The methodology was demonstrated for an FFQ with interest in energy,...

The optimal trajectory planning problem for multiple trains under fixed block signaling systems and moving block signaling systems is considered. Two approaches are proposed to solve this optimal control problem for multiple trains: the greedy approach and the simultaneous approach. In each solution approach, the trajectory planning problem is transformed into a mixed integer linear programming...

The paper focuses on the solution of the minimum loss reconfiguration problem of distribution networks, including embedded generation, by means of a mixed integer linear programming (MILP) model. The proposed model takes into account typical operating constraints of distribution networks (radial configuration, branch ampacity limits and bus voltage requirements). The accuracy of the results and...

One way to address multi-scale optimisation problems is by integrating logic and optimisation. For example, a scheduling problem may have two levels: (i) assigning orders to machines and (ii) sequencing orders on each machine. In a minumum cost model, assigning orders to machines is a mixed-integer optimisation problem, sequencing orders is a constraint satisfaction problem. The entire problem ...

In this paper, we study the security of SM4 block cipher against (related-key) differential cryptanalysis by making use of the Mixed Integer Linear Programming (MILP) method. SM4 is the first commercial block cipher standard of China, which attracts lots of attentions in cryptography. To analyze the security of SM4 against differential attack, we exploit a highly automatic MILP method to determ...