Nowadays, oil companies have to deal with an increasingly competitive environment. In this sense, the optimization of operational processes to enhance efficiency is crucial. This article addresses the design of a decision support tool for the inland upstream transport logistics in the oil industry based on a case of study in Argentina. This problem is traditionally difficult to solve for managers due to the large number of demand facilities scattered on a large geographic area that have to be served and the consideration of several operational requirements, such as maximum allowable travel times for vehicles, availability of a limited fleet size with a small number of drivers, plus the usual demand constraints as well as those arising from security risks derived from the incompatibility of chemical products. A novel mathematical formulation and a constructive heuristic are proposed in order to address this problem. The results allow to reduce the time that the company spends for obtaining a feasible distribution plan that minimizes the time horizon of the distribution schedule provided to the clients and enhances customer satisfaction.

The literature on flow shop scheduling has extensively analyzed two classes of problems: permutation and non-permutation ones (PFS and NPFS). Most of the papers in this field have been just devoted on comparing the solutions obtained in both approaches. Our contribution consists of analyzing the structure of the critical paths determining the makespan of both kinds of schedules for the case of 2 jobs and m machines. We introduce a new characterization of the critical paths of PFS solutions as well as a decomposition procedure, yielding a representation of NPFS solutions as sequences of partial PFS ones. In structural comparisons we find cases in which NPFS solutions are dominated by PFS solutions. Numerical comparisons indicate that a wider dispersion of processing times improves the chances of obtaining optimal non-permutation schedules, in particular when this dispersion affects only a few machines.

The competition manufacturing companies face has driven the development of novel and efficient methods that enhance the decision making process. In this work, a specific flow shop scheduling problem of practical interest in the industry is presented and formalized using a mathematical programming model. The problem considers a manufacturing system arranged as a work cell that takes into account the transport operations of raw material and final products between the manufacturing cell and warehouses. For solving this problem, we present a multiobjective metaheuristic strategy based on simulated annealing, the Pareto Archived Simulated Annealing (PASA). We tested this strategy on two kinds of benchmark problem sets proposed by the authors. The first group is composed by small-sized problems. On these tests, PASA was able to obtain optimal or near-optimal solutions in significantly short computing times. In order to complete the analysis, we compared these results to the exact Pareto front of the instances obtained with augmented ε-constraint method. Then, we also tested the algorithm in a set of larger problems to evaluate its performance in more extensive search spaces. We performed this assessment through an analysis of the hypervolume metric. Both sets of tests showed the competitiveness of the Pareto Archived Simulated Annealing to efficiently solve this problem and obtain good quality solutions while using reasonable computational resources.

We present here a hybrid algorithm for the Flexible Job-Shop Scheduling Problem (FJSSP). This problem involves the optimal use of resources in a flexible production environment in which each operation can be carried out by more than a single machine. Our algorithm allocates, in a first step, the machines to operations and in a second stage it sequences them by integrating a Multi-Objective Evolutionary Algorithm (MOEA) and a path-dependent search algorithm (Multi-Objective Simulated Annealing), which is enacted at the genetic phase of the procedure. The joint interaction of those two components yields a very efficient procedure for solving the FJSSP. An important step in the development of the algorithm was the selection of the right MOEA. Candidates were tested on problems of low, medium and high complexity. Further analyses showed the relevance of the search algorithm in the hybrid structure. Finally, comparisons with other algorithms in the literature indicate that the performance of our alternative is good.

In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

In this paper, we present a new decision-making tool aimed at improving the efficiency of the operational planning of pick-up processes in logistic distribution centers. It is based on a memetic algorithm (MA) solving both the Order Batching Problem (OBP) and the Order Picking Problem (OPP). The result yields a sequence of simultaneous pick up operations of lots for different clients in a storing facility, satisfying a previously defined distribution plan. The objective is the minimization of the operational cost of the entire process, which is directly proportional to the time spent on different activities involved. The failure to satisfy the conditions, either leads to overstocking, delays in delivery or creates inefficiency costs. The analysis of the results obtained with our algorithmic tool indicates that it has a good performance in comparison with other known algorithms used to solve this kind of problem.

The separation at the source of Municipal Solid Waste (MSW) is an initiative that facilitates the subsequent recycling work and contributes to palliate the negative impacts of the traditional unsorted collection system. This paper presents a multi-objective integer linear programming model of the determination of the optimal location of assorted waste bins in an urban area. We consider, jointly, the objectives of minimizing the investment cost and the average distance from the dwellings to the bins. The model was applied in simulated instances of an Argentinian medium-size city, contributing to the transition from the current door-to-door based system to a community bins system. To solve this problem, we apply both the weighting method, which has been used to solve similar problems in the literature, and a novel version of the augmented ε-constraint method (AUGMECON2). The results over simulated scenarios show that, in general, AUGMECON2 has a better performance, yielding a larger number of efficient solutions at lower computation times.

This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP) problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), which is a variant of the Travelling Salesman Problem (again a NP-Hard problem) with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.

This paper analyzes the choice of a PISA selector for a Hybrid Algorithm integrating it as a Multi-Objective Evolutionary Algorithm (MOEA) with a path-dependent search algorithm. The interaction between these components provides an efficient procedure for solving Multi-Objective Problems (MOPs) in operations scheduling. In order to choose the selector, we consider both NSGA and SPEA as well as their successors (NSGAII and SPEAII). NSGAII and SPEAII are shown to be the most efficient candidates. On the other hand, for the path-dependent search at the end of each evolutionary phase we use the multi-objective version of Simulated Annealing.