Sharif Digital Repository

A rescheduling method for new order arrival is presented based on the concept of dynamic pegging in multi-level production. Upon the arrival of new, unplanned orders, dynamic pegging enables the re-assignment of the Work-In-Progress (WIP) to the existing or newly arrived orders in such a way that the cost of rescheduling is minimized. A simple yet inspiring Mixed Integer Programming (MIP) model is proposed that combines dynamic pegging with rescheduling. The resulting schedules are compared with the ones obtained from two other basic rescheduling approaches. Analysis of the comparisons confirm the superiority of the proposed method in terms of total rescheduling costs. © 2019  

This research studies multi-objective master production schedule (MPS) and advanced order commitment (AOC) in two-stage supply chains. Simulation-based experimental analysis evaluates the impact of environmental and MPS design factors on schedule cost and instability. The results provide insight into multi-objective MPS design considerations through rolling schedule policies. The study reveals that the manufacturers production smoothness utility coefficient and its interaction with other experimental factors considerably impact on the systems performance. In addition, it introduces a simulation framework with embedded mixed integer programming models that could be used as a framework for... 

Facility layout problem (FLP) is one of the classical and important problems in real-world problems in the field of industrial engineering where efficiency and effectiveness are very important factors. To have an effective and practical layout, the deterministic assumptions of data should be changed. In this study, it is assumed that we have dynamic and uncertain values for departments’ dimensions. Accordingly, each dimension changes in a predetermined interval. Due to this assumption, two new parameters are introduced which are called length and width deviation coefficients. According to these parameters, a definition for layout in uncertain environment is presented and a mixed integer... 

The Multi-Floor Layout Problem (MFLP) is the problem of finding the position of each department in a plant floor in a multi-floor building without any overlapping between departments in order to optimize a particular objective function, more commonly the sum of the material handling costs. In this paper, a special class of MFLP, called Uncertain Multi-Floor Discrete Layout Problem (UMFDLP), is defined. In this problem, a multi-floor building is considered in which an underground store is utilized to contain main storages, and different departments can be located in the other floors in potential pre-determined locations. Furthermore, all material flows are not constant. Moreover, the... 

Cloud manufacturing is an emerging service-oriented manufacturing paradigm that integrates and manages distributed manufacturing resources through which complex manufacturing demands with a high degree of customization can be fulfilled. The process of Service Composition and Optimal Selection (SCOS) is an important issue for practical implementation of cloud manufacturing. In this paper, a new Mixed Integer Programming (MIP) model for solving the SCOS with transportation consideration has been proposed. This model minimizes both manufacturing and transportation costs subject to some constraints such as necessity of transportation between manufacturing resources and the requirements specified... 

The railroad blocking problem is an important issue at the tactical level of railroad freight transportation. This problem consists of determining paths between the origins and destinations of each shipment to minimize the operating and user costs while satisfying the railroad supply and demand restrictions. A mixed-integer program (MIP) is developed to find the optimal paths, and a new heuristic is developed to solve the proposed model. This heuristic decomposes the model into two sub-problems of manageable size and then provides feasible solutions. We discuss the performance of the proposed heuristic for a set of instances with up to 90 stations. A comparison with the CPLEX MIP solver... 

This paper presents a new predictive-reactive rescheduling method for adjusting production schedules in response to the unplanned arrival of new orders in multi-level production. It is based on the concept of dynamic pegging, which enables the reassignment of the Work-In-Progress (WIP) to the existing or newly arrived orders at the time of rescheduling. Extending our previous work on reactive rescheduling with dynamic pegging, the new approach incorporates a probabilistic predictive model of new order arrival in the initial scheduling at the begging of the scheduling horizon. A Mixed Integer Programming (MIP) model is developed for two-phase, predictive-reactive scheduling before and after... 

In this paper a new predictive-reactive rescheduling method is presented based on the dynamic pegging concept. Scheduling adjustments in a multi-level, mixed-model production system are invoked in response to the unplanned events, such as new order arrival, changes in due dates, and order cancellation. By using the dynamic pegging approach at the time of rescheduling, Work-In-Progress (WIP) can be reassigned to the existing or new orders. Based on our previous work on reactive-only rescheduling with dynamic pegging, a Mixed Integer Programming (MIP) model is developed for predictive-reactive scheduling of new orders of different product types that arrive following exponential distribution. A... 

This paper presents a special case of the general shop called partial job shop problem. The partial job shop is a more realistic generalization of the mixed shop problem. The problem is formulated as a mixed integer programming model. A scatter search algorithm combined with tabu search and path relinking is used to tackle this problem with makespan criterion. The computational experiments are performed on some problem instances. The results are compared with a lower bound and the effectiveness of the algorithm is shown  

In order to maintain the production of offshore oil wells, the National Iranian Oil Company periodically services facilities and equipment located in oil wellheads with mobile wellhead servants. It also gives technical supports to oil wellheads and mobile wellhead servants with supporter vessels. Due to supply limitations, there are not enough special vessels (namely supporter vessels and mobile wellhead servants) compared to the number of oil wellheads. The failure of special vessels to service oil wellheads and supporter vessels to technically support mobile wellhead servants based on a predetermined plan, will lead to considerable loss in production performance of oil wells and hence... 

This paper studies the transit network scheduling problem and aims to minimize the waiting time at transfer stations. First, the problem is formulated as a mixed integer programming model that gives the departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting times. Then, the model is expanded to a second model by considering the extra stopping time of vehicles at transfer stations as a new variable set. By calculating the optimal values for these variables, transfers can be better performed. The sizes of the models, compared with the existing models, are small enough that the models can be solved for small- and medium-sized... 

Single floor facility layout problem (FLP) is related to finding the arrangement of a given number of departments within a facility; while in multi-floor FLP, the departments should be imbedded in some floors inside the facility. The significant influence of layout design on the effectiveness of any organization has turned FLP into an important issue. This paper presents a three- (two-) stage mathematical programming method to find competitive solutions for multi- (single-) floor problems. At the first stage, the departments are assigned to the floors through a mixed integer programming model (the single floor version does not require this stage). At the second stage, a nonlinear programming... 

Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for subway operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains,... 

An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-allocation cost is minimized. Pipeline systems in natural gas network must be designed based on gas flow rate, length of pipe, gas maximum pressure drop allowance, and gas maximum velocity allowance. We use the information regarding gas flow rates and pipe diameter sizes considering the gas pressure and...