although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

In this paper, the strategic planning of a supply chain under a static chain-to-chain competition on the plane is addressed. It is assumed that each retailer has a coverage area called the radius of influence. The demand of each demand zone is divided equally between the retailers which can cover that market. However, the demand of distant customers who are not in the retailers’ radius of influ...

Integrated production-distribution planning (PDP) is one of the most important approaches in supply chain networks. We consider a supply chain network (SCN) to consist of multi suppliers, plants, distribution centers (DCs), and retailers. A bi-objective mixed integer linear programming model for integrating production-distribution designed here aim to simultaneously minimize total net costs in ...

In this paper, a multi-period replacement model, based on a mixed integer nonlinear programming formulation, is developed for flexible automation investments. The model takes into account the costs, benefits and effective utilization of several types of flexibility. The decision variables pertain to the selection and optimal implementation sequence for new, CNC modules, the replacement schedule...

Manufacturers need to satisfy consumer demands in order to compete in the real world. This requires the efficient operation of a supply chain planning. In this research we consider a supply chain including multiple suppliers, multiple manufacturers and multiple customers, addressing a multi-site, multiperiod, multi-product aggregate production planning (APP) problem under uncertainty. First a n...

in this paper a new method is proposed for path planning of planar manipulators amid obstacles through mathematical programming in a way that the robot’s links avoid collision with obstacles throughout their motion from an initial to a goal configuration. after inputting the workspace geometry, the shortest feasible path for the robot’s end-effector is planned toward its goal position using gen...

The aim of this study is to propose a new mixed integer linear programming (MILP) model to find the minimum required number of yard cranes, Rubber tyred gantry cranes (RTGCs), for completion the total amount of works at the end of planning horizon. In other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. The paper supports the p...