The automotive sector operates under the just-in-time (JIT) approach, but variations in demand mean that first-tier suppliers generate an accumulation of stocks at second-tier suppliers. Second-tier have a limitation storage space, reason to limit their production size warehouse, always attending plan. A further supplier is number empty reusable containers delivers and are used package injected...

Long-Reach Passive Optical Network (LR-PON) using hybrid TDM/WDM techniques is one of the candidates for the future optical access that can solve the expected increase in terms of traffic demand and area coverage. One of its advantages is the possibility to share the capacity of any wavelength among more than one user, through TDM/WDM hybrid multiplexing. However, it is still an open issue whic...

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

This paper presents two novel solution approaches for addressing large-scale multi-floor process plant layout problems. Based on the mixed integer linear programming (MILP) model, first approach employs a multi-directional search strategy while second improves efficiency by reducing model size through an iterative framework. Both determine spatial arrangement of equipment considering equipment-...

Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory’s corner relaxation is obtained by dropping nonnegativity constraints on the basic variables. Although this relaxation received a considerable attention in the literature in the last 40 years, the crucial issue of evaluating the practical quality of the corner-r...

We show how some simple logical constraints can substantially accelerate the solution of mixed integer linear programming (MILP) models for the design of chemical processing networks. These constraints are easily generated in a preprocessing stage and can be applied either symbolically during a branch-and-bound search or as constraints in the MILP model. Furthermore, they represent a new class ...

This work addresses a balancing problem approach whose objective is to minimizing the ergonomic risk dispersion between the set of workstations of a mixed-model assembly line and the risk level of the workstation with the greatest hazard. A GRASP procedure is proposed to achieve these two challenges simultaneously. This new procedure is compared with two Mixed Integer Linear Programs, the MILP-...

We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...

A mixed integer linear programming (MILP) technique simultaneously minimizes the leakage and glitch power consumption of a static CMOS circuit for any specified input to output delay. Using dual-threshold devices the number of high-threshold devices is maximized and a minimum number of delay elements are inserted to reduce the differential path delays below the inertial delays of incident gates...