Scheduling Trains as a blocking parallel-machine job shop scheduling problem
|
PDF
(523kB)
Computers_and_Operations_Research__Scheduling_trains_as_a_blocking_parallel_machine_job_shop_scheduling_problem_.pdf. |
Description
In this paper, the train scheduling problem is modelled as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the model, trains, single-track sections and multiple-track sections, respectively, are synonymous with jobs, single machines and parallel machines, and an operation is regarded as the movement/traversal of a train across a section. Due to the lack of buffer space, the real-life case should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold the train until next section on the routing becomes available. Based on literature review and our analysis, it is very hard to find a feasible complete schedule directly for BPMJSS problems. Firstly, a parallel-machine job-shop-scheduling (PMJSS) problem is solved by an improved shifting bottleneck procedure (SBP) algorithm without considering blocking conditions. Inspired by the proposed SBP algorithm, feasibility satisfaction procedure (FSP) algorithm is developed to solve and analyse the BPMJSS problem, by an alternative graph model that is an extension of the classical disjunctive graph models. The proposed algorithms have been implemented and validated using real-world data from Queensland Rail. Sensitivity analysis has been applied by considering train length, upgrading track sections, increasing train speed and changing bottleneck sections. The outcomes show that the proposed methodology would be a very useful tool for the real-life train scheduling problems
Impact and interest:
Citation counts are sourced monthly from Scopus and Web of Science® citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.
Full-text downloads:
Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
ID Code: | 29818 | ||
---|---|---|---|
Item Type: | Contribution to Journal (Journal Article) | ||
Refereed: | Yes | ||
ORCID iD: |
|
||
Measurements or Duration: | 13 pages | ||
Keywords: | Blocking, Job Shop Scheduling, Parallel Machine, Train scheduling | ||
DOI: | 10.1016/j.cor.2008.12.012 | ||
ISSN: | 0305-0548 | ||
Pure ID: | 31960323 | ||
Divisions: | Past > QUT Faculties & Divisions > Faculty of Science and Technology Past > QUT Faculties & Divisions > Science & Engineering Faculty Current > Research Centres > Australian Research Centre for Aerospace Automation |
||
Copyright Owner: | Consult author(s) regarding copyright matters | ||
Copyright Statement: | This work is covered by copyright. Unless the document is being made available under a Creative Commons Licence, you must assume that re-use is limited to personal use and that permission from the copyright owner must be obtained for all other uses. If the document is available under a Creative Commons License (or other specified license) then refer to the Licence for details of permitted re-use. It is a condition of access that users recognise and abide by the legal requirements associated with these rights. If you believe that this work infringes copyright please provide details by email to qut.copyright@qut.edu.au | ||
Deposited On: | 19 Jan 2010 21:37 | ||
Last Modified: | 01 May 2024 08:42 |
Export: EndNote | Dublin Core | BibTeX
Repository Staff Only: item control page