Production and Inter-Facility Transportation with Shipment Size Restrictions

2013 ◽  
pp. 74-92
Author(s):  
Mohamed K. Omar
Keyword(s):  
Integer Programming ◽  
Transportation Problem ◽  
Mixed Integer ◽  
Actual Performance ◽  
Industrial Data ◽  
Chemical Company ◽  
Mip Model ◽  
Proposed Model ◽  
Production Inventory ◽  
End Products

This chapter studies production and transportation problem confronting a speciality chemical company that has two manufacturing facilities. Facility I produces intermediate products which are then transported to Facility II where the end products are to be manufactured to meet customers’ demand. The author formulated the problem as a mixed integer programming (MIP) model that integrates the production and transportation decisions between the two facilities. The developed MIP aims to minimize the production, inventory, manpower, and transportation costs. Real industrial data are used to test and validate the developed MIP model. Comparing the model’s results and the company’s actual performance indicate that, if the company implemented the proposed model, significant costs savings could be achieved.

scholarly journals Transfer Coordination for Metro Networks during the Start- or End-of-Service Period

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Liqiao Ning ◽  
Peng Zhao ◽  
Wenkai Xu ◽  
Ke Qiao
Keyword(s):  
Integer Programming ◽  
Adverse Effects ◽  
Waiting Time ◽  
Programming Model ◽  
Mixed Integer ◽  
Service Period ◽  
Proposed Model ◽  
Transfer Success ◽  
Metro Networks

When travelling via metro networks during the start- or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.

Optimal Planning for Product Blending

2011 ◽  
Vol 339 ◽  
pp. 358-361
Author(s):  
Guo Li Liu ◽  
Jun Zhao ◽  
Wei Wang
Keyword(s):  
Programming Model ◽  
Material Balance ◽  
Oil Refinery ◽  
Mixed Integer ◽  
Optimal Planning ◽  
Setup Costs ◽  
Proposed Model ◽  
Production Inventory ◽  
Product Blending ◽  
Blending Problem

This paper deals with the product blending problem originating from the production system of a large typical oil refinery. A deterministic mixed integer programming model is proposed. The objective is to make an effective production-inventory plan for product blending unit (PBU) in order to meet the demand of product oil with no backlogging allowed and minimize the total costs, that is, the sum of purchasing, production, inventory and setup costs. The constraints related to material balance, different capacities and different production schemes are considered. A numerical example is subsequently provided to illustrate the broad applicability of the proposed model.

scholarly journals Operating Room Scheduling in Teaching Hospitals

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Somayeh Ghazalbash ◽  
Mohammad Mehdi Sepehri ◽  
Pejman Shadpour ◽  
Arezoo Atighehchian
Keyword(s):  
Operating Room ◽  
Real Life ◽  
Operating Rooms ◽  
Mixed Integer ◽  
Teaching Hospitals ◽  
Operating Room Scheduling ◽  
Start Time ◽  
The Real ◽  
Mip Model ◽  
Proposed Model

Operating room scheduling is an important operational problem in most hospitals. In this paper, a novel mixed integer programming (MIP) model is presented for minimizing Cmax and operating room idle times in hospitals. Using this model, we can determine the allocation of resources including operating rooms, surgeons, and assistant surgeons to surgeries, moreover the sequence of surgeries within operating rooms and the start time of them. The main features of the model will include the chronologic curriculum plan for training residents and the real-life constraints to be observed in teaching hospitals. The proposed model is evaluated against some real-life problems, by comparing the schedule obtained from the model and the one currently developed by the hospital staff. Numerical results indicate the efficiency of the proposed model compared to the real-life hospital scheduling, and the gap evaluations for the instances show that the results are generally satisfactory.

Joint Deployment of Quay Cranes and Yard Cranes in Container Terminals at a Tactical Level

2018 ◽  
Vol 2672 (9) ◽  
pp. 35-46
Author(s):  
Lingxiao Wu ◽  
Shuaian Wang
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Container Terminal ◽  
Turnaround Time ◽  
Container Terminals ◽  
Mixed Integer ◽  
Sequential Method ◽  
Quay Cranes ◽  
Proposed Model

This paper discusses tactical joint quay crane (QC) and yard crane (YC) deployment in container terminals. The deployments of QCs and YCs are critical for the efficiency of container terminals. Although they are closely intertwined, the deployments of QCs and YCs are usually sequential. This paper proposes a mixed-integer programming model for the joint deployment of QCs and YCs in container terminals. The objective of the model is to minimize the weighted vessel turnaround time and the weighted delayed workload for external truck service in yard blocks, both of great importance for a container terminal but rarely considered together in the literature. This paper proves that the studied problem is NP-hard in the strong sense. Case studies demonstrate that the proposed model can obtain better solutions than the sequential method. This paper also investigates the most effective combinations of QCs and YCs for a container terminal at various demand levels.

Tandem Lift Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

2014 ◽  
Vol 505-506 ◽  
pp. 927-930 ◽  
Author(s):  
Li Hua Chen ◽  
Jin Xin Cao ◽  
Qing Yu Zhao
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Container Terminals ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Truck Scheduling ◽  
Mip Model ◽  
Quay Cranes ◽  
Local Sequence ◽  
Cut Method

The reasonable dispatching and scheduling of the Tandem Quay Cranes and trucks is the foundation to improve the efficiency of the container terminals. Under the base of single lift quay cranes research, a research on Tandem Lift Quay Cranes and Yard Trucks scheduling is carried on in this paper. A mixed integer programming (MIP) model can be built to solve an integrated tandem lift quay crane and yard truck scheduling problem (i-TLQCYT). A Local Sequence-cut Method is applied to solve the model. Then the shortest time to complete the unloading operations can be got.

scholarly journals Effect of prior probabilities on the classificatory performance of parametric and mathematical programming approaches to the two-group discriminant problem

1997 ◽  
Vol 1 (1) ◽  
pp. 45-51 ◽  
Author(s):  
Constantine Loucopoulos
Keyword(s):  
Integer Programming ◽  
Mathematical Programming ◽  
Group Membership ◽  
Programming Model ◽  
Simulated Data ◽  
Parametric Models ◽  
Mixed Integer ◽  
Prior Probabilities ◽  
Normal Populations ◽  
Proposed Model

A mixed-integer programming model (MIP) incorporating prior probabilities for the two-group discriminant problem is presented. Its classificatory performance is compared against that of Fisher's linear discrimininant function (LDF) and Smith's quadradic discriminant function (QDF) for simulated data from normal and nonnormal populations for different settings of the prior probabilities of group membership. The proposed model is shown to outperform both LDF and QDF for most settings of the prior probabilities when the data are generated from nonnormal populations but underperforms the parametric models for data generated from normal populations.

scholarly journals Scheduling Additional Train Unit Services on Rail Transit Lines

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Zhibin Jiang ◽  
Yuyan Tan ◽  
Özgür Yalçınkaya
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Optimization Model ◽  
Mixed Integer ◽  
Rail Transit ◽  
Mip Model ◽  
Time Periods ◽  
Transit Agencies ◽  
Integration Strategies ◽  
Special Time

This paper deals with the problem of scheduling additional train unit (TU) services in a double parallel rail transit line, and a mixed integer programming (MIP) model is formulated for integration strategies of new trains connected by TUs with the objective of obtaining higher frequencies in some special sections and special time periods due to mass passenger volumes. We took timetable scheduling and TUs scheduling as an integrated optimization model with two objectives: minimizing travel times of additional trains and minimizing shifts of initial trains. We illustrated our model using computational experiments drawn from the real rail transit line 16 in Shanghai and reached results which show that rail transit agencies can obtain a reasonable new timetable for different managerial goals in a matter of seconds, so the model is well suited to be used in daily operations.

Sign in / Sign up

Export Citation Format

Share Document