Abstract

Abstract
This work proposes a mathematical programming model for jointly scheduling of production and transport in flexible manufacturing systems considering alternative job routing. Although production scheduling and transport scheduling have been vastly researched, most of the works address them independently. In addition, the few that consider their simultaneous scheduling assume job routes as an input, i.e., the machine -operation allocation is previously determined. However, in flexible manufacturing systems, this is an important source of flexibility that should not be ignored. The results show the model efficiency in solving small -sized instances.

Abstract
This work proposes a biased random key genetic algorithm (BRKGA) for the integrated scheduling of manufacturing, transport, and storage/retrieval operations in flexible manufacturing systems (FMSs). Only recently, research on this problem has been reported; however, no heuristic approaches have yet been reported. The computational results show the BRKGA to be capable of finding good quality solutions quickly.

Abstract
This work proposes an integrated formulation for the joint production and transportation scheduling problem in flexible manufacturing environments. In this type of systems, parts (jobs) need to be moved around as the production operations required involve different machines. The transportation of the parts is typically done by a limited number of Automatic Guided Vehicles (AGVs). Therefore, machine scheduling and AGV scheduling are two interrelated problems that need to be addressed simultaneously. The joint production and transportation scheduling problem is formulated as a novel mixed integer linear programming model. The modeling approach proposed makes use of two sets of chained decisions, one for the machine and another for the AGVs, which are inter-connected through the completion time constraints both for machine operations and transportation tasks. The computational experiments on benchmark problem instances using a commercial software (Gurobi) show the efficiency of the modeling approach in finding optimal solutions.

Abstract
This paper addresses a distribution problem involving a set of different products that need to be distributed among a set of geographically disperse retailers and transported from the single warehouse to the aforementioned retailers. The disfribution and transportation are made in order to satisfy retailers' demand while satisfying storage limits at both the warehouse and the retailers, transportation limits between the warehouse and the retailers, and other operational constraints. This problem is combinatorial in nature as it involves the assignment of a discrete finite set of objects, while satisfying a given set of conditions. Hence, we propose a genetic algorithm that is capable of finding good quality solutions. The genetic algorithm proposed is used to a real case study involving the disfribution of eight products among 108 retailers from a single warehouse. The results obtained improve on those of company's current practice by achieving a cost reduction of about 13%.

Abstract
This paper proposes a mixed integer linear programming model for a multi-product ordering in a three-echelon supply chain network, where multiple manufacturers supply multiple warehouses with multiple products, which in turn distribute the products to the multiple retailers involved. The model considers practical production constraints such as production capacity, backorder allowances, and economically-viable minimum order quantities. Numerical computations show that the model can efficiently solve small-sized problem instances. © 2019, IEOM Society International.