in this paper a scheduling problem in a 2-stage supply chain is discussed. suppliers are in the first stage and in the second stage, there are vehicles which carry orders to a manufacturing center. the purpose is to allocate orders to suppliers, sequence the suppliers’ production, allocate orders to transport vehicles and prioritize orders that should be carried by vehicles to minimize the tota...

In this thesis, two main subjects are discussed. The first subject is distributed solving techniques for disjunctive and Mixed Integer (Non)Linear Programming and the second is the scheduling of operations in the process industry. Disjunctive optimization techniques have been considered as an alternative to methods based on mixed integer linear programming. This is especially the case in the ch...

In this paper we analyze a continuous version of the maximal covering location problem, in which facilities are required to be linked by means given graph structure (provided that two allowed if distance is not exceed). We propose mathematical programming framework for problem and different resolution strategies. First, provide Mixed Integer Non Linear Programming formulation derive some geomet...

In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models studied in mathematical finance for several decades have attracted attention in stochastic programming. We consider Conditional Value-at-Risk as risk measure in the framework of two-stage stochastic integer programming. The paper addresses structure, stability, and algori...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...

This paper focuses on the collision-free coordination of multiple robots with kinodynamic constraints along specified paths. We present an approach to generate continuous velocity profiles for multiple robots; these velocity profiles satisfy the dynamics constraints, avoid collisions, and minimize the completion time. The approach, which combines techniques from optimal control and mathematical...