| |||||||||
SCHEDULING ABSTRACTS"Efficient Circulation of Railway Rolling Stock"
ARIANNA ALFIERI, Polytechnic University of Turin - Department of Production Systems and Business Economics (DISPEA)
Railway rolling stock (locomotives, carriages, and train units) is one of the most significant cost sources for operatorsof passenger trains, both public and private. Rolling stock costsare due to material acquisition, power supply, and material maintenance. The efficient circulation of rolling stock material is therefore one of the objectives pursued. In this paper we focus on the circulation of train units on a single line. In order to utilize the train units on this line in an efficient way, they are added to or removed from the trains in certain stations, according to the passengers' seat demand. Since adding and removing train units has to respect specific rules, it is important to know the exact order of the train units in the trains. This aspect strongly increases the complexity of the rolling stock circulation problem. In this paper we present aninteger programming approach to solve this problem. We also apply this approach to a real life case study based on the 2001-2002 timetable of NS Reizigers, the major Dutch operator of passenger trains.
"The Cross-Functional Coordination between
Operations, Marketing, Purchasing and Engineering
and the Impact on Performance"
AMELIA CARR, Bowling Green State University This paper is a study of the coordination capability between operations and other functional areas within the firm. The paper examines a number of relationships with respect to cross-functional coordination and performance. Using a random sample of 231 firms, five hypotheses are tested. Structural equation modelling is used to test the relationships depicted in the research model. The results indicate that firms can benefit from the cross-functional coordination between operations, marketing, engineering and purchasing. "Improved Lower Bounds for the Capacitated Lot Sizing Problem with Set Up Times"
Z. DEGRAEVE, affiliation not provided to SSRN
We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network reformulation of the problem. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and set up constraints. We propose a customized branch-and-bound algorithm for solving the subproblem based on its similarities with the Linear Multiple Choice Knapsack Problem. Further we present a Lagrange Relaxation algorithm for finding this lower bound. To the best of our knowledge, this is the first time that computational results are presented for this decomposition and a comparison of our lower bound to other lower bounds proposed in the literature indicates its high quality.
| |||||||||
^top
Solicitation of Abstracts
This abstracting journal distributes working and accepted papers concerned with the importance of allocation of different servers and agents to handle multiple operational and customer service demands. The journal welcomes research with a focus on the prioritization of servers to handle continuously arising demands to reduce the customer wait times. Topics of interest include, but are not limited to, workforce scheduling, queuing theory, determining optimal number of servers, and labor staffing for controlling the service levels.
Distribution ServicesIf your Institution is interested in learning more about increasing readership for its research by becoming a Partner in Publishing or starting a Research Paper Series, please email: Management@SSRN.com. Distributed by:DirectorsPROD SUBJECT MATTER EJOURNALS MICHAEL C. JENSEN Please contact us at the above addresses with your comments, questions or suggestions for PROD-Sub.
|
|
| | ||||||
