The aim of this work is to propose a mathematical programming model for the Economic Lot Scheduling Problem (ELSP) with performance decay. The main difficulties related to this model are the nonlinearities and/or nonconvexities associated with the dynamic behavior of the system with time. Firstly, the problem is formulated as a Mixed Integer Non Linear Program (MINLP), which is found to be nonc...

ij ij Q P , CONCLUSIONS A general purpose MILP model for allocation problems in any given number of dimensions is presented. The model is concerned with the allocation of items in an N-dimensional space. To demonstrate the formulation, a number of illustrative examples in different number of dimensions are solved. 1, 2, 3 and 4-dimensional problems are presented and solved using the proposed mo...

This paper deals with the problem of finding optimal feeding sequence in a manufacturing cell with feeders fed by a mobile robot with manipulation arm. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. Besides, the robot has to be scheduled in order to keep production lines within the cell working without any shortage of parts fed from feede...

Truck and shovel are the most common raw material transportation system used in the cement quarry operations. One of the major challenges associated with the cement quarry operations is the efficient allocation of truck and shovel to the mining faces. In order to minimize the truck and shovel operating cost, subject to quantity and quality constraints, the mixed integer linear programing (MILP)...

This paper addresses the problem of developing an optimisation model to aid the operational decision-making process in pipeline systems. The model is applied on a real world pipeline oil distribution scenario, which connects an inland refinery to a harbour, conveying multiple types of commodities. The optimisation model was developed based on mixed integer linear programming (MILP) with uniform...

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 m-processo...

In railways, the long-term strategic planning is process of evaluating improvements to railway network (e.g., upgrading a single track line double line) and changes composition/frequency train services adding 1 per hour along certain route). The effects different combinations infrastructure upgrades updated (also called scenarios), are usually evaluated by creating new feasible timetables follo...

The Alternative Subgraphs Assembly Line Balancing Problem (ASALBP) considers assembly alternatives that determine task processing times and/or precedence relations among the tasks. Capacho and Pastor [3] formalized this problem and developed a mathematical programming model (MILP) in which the assembly alternatives are determined by combining all available processing alternatives of each existi...

Deep Neural Networks (DNNs) are very popular these days, and are the subject of a very intense investigation. A DNN is made by layers of internal units (or neurons), each of which computes an affine combination of the output of the units in the previous layer, applies a nonlinear operator, and outputs the corresponding value (also known as activation). A commonly-used nonlinear operator is the ...