Railway capacity has been a significant issue in the railway industry. Over the last few years, numerous approaches and tools have been developed to compute railway capacity. In this paper, we compute railway capacity to design a topological model for solving periodic train scheduling, developed in collaboration with the National Network of Spanish Railways (RENFE). This topological technique t...

Whilst few studies have explored royalty negotiations for build, operate and transfer (BOT) projects, some works have proposed numerous royalty formulas to evaluate royalty amounts or franchise fees for a BOT project. Despite this, the royalty negotiation process is one of the many critical negotiation items of a concession contract. This study not only developed a royalty negotiation model for...

In this study, a computerized nurse-scheduling model is developed. The model is approached through a 0-1 linear goal program. It is adapted to Riyadh Al-Kharj hospital Program (in Saudi Arabia) to improve the current manual-made schedules. The developed model accounts both for hospital objectives and nurses’ preferences, in addition to considering some recommended policies that are displayed in...

Facility location allocation problem is a very important issue in today's global logistic management. Various facility location problems have been considered in operations research under somehow stringent conditions to reduce the search space. In this paper, we consider a class of single source capacitated facility location allocation problems that can assume more realistic conditions in real l...

Intermodal goods transport is characterized by a main transport by rail, barge or seaborne vessel, preceded and followed by short in time but expensive road transport. Many times trucks pick-up or deliver a single container which leads to a full truckload vehicle routing problem in terms of economically efficient transport services. Time windows induced by the customer or due to external situat...

The so called quick check (henceforth QC) preunification filter for feature structure (FS) unification was introduced by (Kiefer et al., 1999). QC is considered the most important speed-up technique in the framework of non-compiled FS unification. We present two potential ways in which the design of the quick check can be further extended: consistency sort check on coreferenced paths, and preun...

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs and a mathematical model based on binary integer programming (BIP) is developed. Since the precedence constraints exist, a job cannot start before completion of its all predecessors. The proposed model consists of two steps: in the first step, the earliest starting time of each job is c...

Recently studies in area of supply chain network (SCN) have focused on the disruption issues in distribution systems. Also this paper extends the previous literature by providing a new biobjective model for cost minimization of designing a three echelon SCN across normal and failure scenarios with considering multi capacity option for manufacturers and distribution centers. Moreover, in order t...

Indexing structures are of fundamental importance to mathematical programming modeling languages. We propose a taxonomy of the most commonly used indexing structures and illustrate it with 25 examples stated in plain but precise English. This paper is an independently useful part of a report that is far too long for inclusion in these proceedings. The full report works all 25 examples in AMPL, ...