ORCID Profile
0000-0002-3208-702X
Current Organisation
Queensland University of Technology
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Applied Mathematics | Operations Research | Industrial Engineering | Primary Health Care | Public Health and Health Services | Building Construction Management and Project Planning | Infrastructure Engineering and Asset Management | Process Control and Simulation | Chemical Engineering | Road And Rail Transportation | Building | Operations Research | Transport Engineering | Health Care Administration | Differential, Difference And Integral Equations | Public Health And Health Services Not Elsewhere Classified | Applied Statistics |
Rail transport | Health and support services not elsewhere classified | Energy Storage, Distribution and Supply not elsewhere classified | Civil Construction Planning | Infectious diseases | Health policy evaluation | Management of Greenhouse Gas Emissions from Construction Activities | Application Tools and System Utilities | Clinical health not specific to particular organs, diseases and conditions | Public health not elsewhere classified | Health not elsewhere classified
Publisher: Informa UK Limited
Date: 02-2011
DOI: 10.1057/JOS.2010.1
Publisher: World Scientific Pub Co Pte Lt
Date: 09-2004
DOI: 10.1142/S021759590400028X
Abstract: Resource constrained scheduling problems are concerned with the allocation of limited resources to tasks over time. The solution to these problems is often a sequence, resource allocation, and schedule. When human workers are incorporated as a renewable resource, the allocation is defined as the number of workers assigned to perform each task. In practice, however, this solution does not adequately address how in idual workers are to be assigned to tasks. This paper, therefore, provides mathematical models and heuristic techniques for solving this multi-period precedence constrained assignment problem. Results of a significant numerical investigation are also presented.
Publisher: Springer Science and Business Media LLC
Date: 24-11-2008
Publisher: Elsevier BV
Date: 09-2015
Publisher: Elsevier BV
Date: 2006
Publisher: Springer Science and Business Media LLC
Date: 08-11-2017
Publisher: Elsevier BV
Date: 11-2014
Publisher: Elsevier BV
Date: 02-2009
Publisher: Informa UK Limited
Date: 03-2000
Publisher: Springer Science and Business Media LLC
Date: 04-08-2012
Publisher: Elsevier BV
Date: 05-2000
Publisher: Springer Science and Business Media LLC
Date: 24-01-2008
Publisher: Elsevier BV
Date: 12-2016
Publisher: Elsevier BV
Date: 08-2017
Publisher: Springer Science and Business Media LLC
Date: 17-05-2011
Publisher: Springer Science and Business Media LLC
Date: 09-2004
Publisher: Elsevier BV
Date: 02-2017
Publisher: Elsevier BV
Date: 12-2016
Publisher: Springer Science and Business Media LLC
Date: 23-06-2012
Publisher: Elsevier BV
Date: 07-2017
Publisher: Informa UK Limited
Date: 11-1995
Publisher: Elsevier BV
Date: 09-2016
Publisher: Wiley
Date: 2001
Publisher: Elsevier BV
Date: 04-2014
Publisher: Elsevier BV
Date: 08-2016
Publisher: Elsevier BV
Date: 12-2012
Publisher: Elsevier BV
Date: 07-2009
Publisher: Elsevier BV
Date: 04-1996
Publisher: Informa UK Limited
Date: 04-2010
DOI: 10.1057/JORS.2009.18
Publisher: Springer International Publishing
Date: 2015
Publisher: Elsevier BV
Date: 2016
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-1998
Abstract: The reliability of urban passenger trains is a critical performance measure for passenger satisfaction and ultimately market share. A delay to one train in a peak period can have a severe effect on the schedule adherence of other trains. This paper presents an analytically based model to quantify the expected positive delay for in idual passenger trains and track links in an urban rail network. The model specifically addresses direct delay to trains, knock-on delays to other trains, and delays at scheduled connections. A solution to the resultant system of equations is found using an iterative refinement algorithm. Model validation, which is carried out using a real-life suburban train network consisting of 157 trains, shows the model estimates to be on average within 8% of those obtained from a large scale simulation. Also discussed, is the application of the model to assess the consequences of increased scheduled slack time as well as investment strategies designed to reduce delay.
Publisher: Elsevier BV
Date: 08-2016
Publisher: Springer Science and Business Media LLC
Date: 26-07-2010
Publisher: Elsevier BV
Date: 2014
Publisher: Elsevier BV
Date: 10-2017
Publisher: Informa UK Limited
Date: 29-10-2009
Publisher: Informa UK Limited
Date: 04-1994
Publisher: Springer Science and Business Media LLC
Date: 14-05-2016
Publisher: Informa UK Limited
Date: 25-11-2016
Publisher: Informa UK Limited
Date: 22-09-2014
Publisher: CSIRO Publishing
Date: 2019
DOI: 10.1071/AH18082
Abstract: Objective Analytical techniques are being implemented with increasing frequency to improve the management of surgical departments and to ensure that decisions are well informed. Often these analytical techniques rely on the validity of underlying statistical assumptions, including those around choice of distribution when modelling uncertainty. The aim of the present study was to determine a set of suitable statistical distributions and provide recommendations to assist hospital planning staff, based on three full years of historical data. Methods Statistical analysis was performed to determine the most appropriate distributions and models in a variety of surgical contexts. Data from 2013 to 2015 were collected from the surgical department at a large Australian public hospital. Results A log-normal distribution approximation of the total duration of surgeries in an operating room is appropriate when considering probability of overtime. Surgical requests can be modelled as a Poisson process with rate dependent on urgency and day of the week. In idual cancellations could be modelled as Bernoulli trials, with the probability of patient-, staff- and resource-based cancellations provided herein. Conclusions The analysis presented herein can be used to ensure that assumptions surrounding planning and scheduling in the surgical department are valid. Understanding the stochasticity in the surgical department may result in the implementation of more realistic decision models. What is known about the topic? Many surgical departments rely on crude estimates and general intuition to predict surgical duration, surgical requests (both elective and non-elective) and cancellations. What does this paper add? This paper describes how statistical analysis can be performed to validate common assumptions surrounding surgical uncertainty. The paper also provides a set of recommended distributions and associated parameters that can be used to model uncertainty in a large public hospital’s surgical department. What are the implications for practitioners? The insights on surgical uncertainty provided here will prove valuable for administrative staff who want to incorporate uncertainty in their surgical planning and scheduling decisions.
Publisher: Wiley
Date: 09-2000
DOI: 10.1111/J.1475-3995.2000.TB00207.X
Abstract: Sequencing problems are difficult combinatorial problems because of the extremely large search space of possible solutions and the large number of “local” optima that arise. Unlike other NP‐hard combinatorial problems, the search space, in general, for sequencing problems (under the makespan objective) consists of sequences with objective function values that lie within only a relatively small amount of each other. This means that when a change is made to the sequence, an improvement or non‐improvement is not easily recognised. This makes the problem much more difficult to solve. A number of constructive heuristics exist that obtain good solutions in a short period of time, however, the output of such algorithms is generally a single sequence which may not be feasible or preferred with respect to industry constraints. Other heuristic algorithms such as Simulated Annealing (SA) and Tabu Search (TS) have also been applied and successes have been reported. However, the performance is dependent upon a number of finely tuned parameters and the output is again only a single solution. For these reasons, Evolutionary Algorithms (EAs) may be suitable solution strategy, for which limited research has been performed. In this research, a number of new EAs have been proposed and a number of modifications have been made to several constructive algorithms to cope with non‐unique jobs or jobs with multiple demands. A numerical comparison of a number of benchmark problems and real data of a truck assembly line has also been presented.
Publisher: Elsevier BV
Date: 03-2013
Publisher: Springer Science and Business Media LLC
Date: 23-05-2021
Publisher: Elsevier BV
Date: 10-2009
Publisher: Springer Science and Business Media LLC
Date: 1997
Publisher: Springer Science and Business Media LLC
Date: 31-12-2022
Publisher: Informa UK Limited
Date: 05-07-2017
Publisher: Maney Publishing
Date: 02-01-2016
Publisher: Elsevier BV
Date: 06-2018
Publisher: Springer Science and Business Media LLC
Date: 20-11-2015
Publisher: Informa UK Limited
Date: 02-1997
Publisher: Informa UK Limited
Date: 17-11-2017
Publisher: Springer Science and Business Media LLC
Date: 16-04-2011
Publisher: Informa UK Limited
Date: 12-2006
Publisher: Wiley
Date: 05-1999
Publisher: Trans Tech Publications, Ltd.
Date: 10-2012
DOI: 10.4028/WWW.SCIENTIFIC.NET/AMR.361-363.1529
Abstract: In this paper, a generic and flexible optimisation methodology is developed to represent, model, solve and analyse the iron ore supply chain system by integrating of iron ore shipment, stockpiles and railing within a whole system. As a result, an integrated train-stockpile-ship timetable is created and optimised for improving efficiency of overall supply chain system. The proposed methodology provides better decision making on how to significantly improve rolling stock utilisation with the best cost-effectiveness ratio. Based on extensive computational experiments and analysis, insightful and quantitative advices are suggested for iron ore mine industry practitioners. The proposed methodology contributes to the sustainability of the environment by reducing pollution due to better utilisation of transportation resources and fuel.
Publisher: Springer Science and Business Media LLC
Date: 06-2004
Publisher: Informa UK Limited
Date: 02-2005
Publisher: Inderscience Publishers
Date: 2001
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 05-2011
Abstract: The paper investigates train scheduling problems when prioritised trains and nonprioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, nonprioritised trains such as freight trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available, which is thought of as a relaxation of no-wait conditions. With thorough analysis of the structural properties of the No-Wait Blocking Parallel-Machine Job-Shop Scheduling (NWBPMJSS) problem that is originated in this research, an innovative generic constructive algorithm (called NWBPMJSS_Liu-Kozan) is proposed to construct the feasible train timetable in terms of a given order of trains. In particular, the proposed NWBPMJSS_Liu-Kozan constructive algorithm comprises several recursively used subalgorithms (i.e., Best-Starting-Time-Determination Procedure, Blocking-Time-Determination Procedure, Conflict-Checking Procedure, Conflict-Eliminating Procedure, Tune-Up Procedure, and Fine-Tune Procedure) to guarantee feasibility by satisfying the blocking, no-wait, deadlock-free, and conflict-free constraints. A two-stage hybrid heuristic algorithm (NWBPMJSS_Liu-Kozan-BIH) is developed by combining the NWBPMJSS_Liu-Kozan constructive algorithm and the Best-Insertion-Heuristic (BIH) algorithm to find the preferable train schedule in an efficient and economical way. Extensive computational experiments show that the proposed methodology is promising because it can be applied as a standard and fundamental toolbox for identifying, analysing, modelling, and solving real-world scheduling problems.
Publisher: Elsevier BV
Date: 09-2009
Publisher: Springer Science and Business Media LLC
Date: 06-03-2017
Publisher: Informa UK Limited
Date: 02-2004
Publisher: Wiley
Date: 07-04-2017
DOI: 10.1111/GEAN.12126
Publisher: Elsevier BV
Date: 02-2007
Publisher: Springer Science and Business Media LLC
Date: 26-10-2021
Publisher: Elsevier BV
Date: 2010
Publisher: Informa UK Limited
Date: 08-2012
Publisher: Informa UK Limited
Date: 23-03-2016
Publisher: Informa UK Limited
Date: 18-02-2016
Publisher: Elsevier BV
Date: 03-1997
Publisher: Elsevier BV
Date: 10-2016
Publisher: Elsevier BV
Date: 09-2006
Publisher: Informa UK Limited
Date: 03-1997
Publisher: Springer Science and Business Media LLC
Date: 19-05-2016
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Elsevier BV
Date: 09-2001
Publisher: Springer Science and Business Media LLC
Date: 04-11-2016
Publisher: Springer International Publishing
Date: 2018
Publisher: Informa UK Limited
Date: 02-2012
DOI: 10.1057/JORS.2011.4
Publisher: IEEE
Date: 10-2014
Publisher: Springer Science and Business Media LLC
Date: 05-05-2006
Publisher: Elsevier BV
Date: 12-2016
Publisher: Elsevier BV
Date: 12-2014
Publisher: Informa UK Limited
Date: 20-03-2015
Publisher: IEEE
Date: 09-2019
Publisher: IEEE
Date: 20-09-2020
Publisher: Springer Science and Business Media LLC
Date: 04-01-2011
Publisher: Informa UK Limited
Date: 12-2001
Publisher: Elsevier BV
Date: 2018
Publisher: Informa UK Limited
Date: 09-2007
Start Date: 2006
End Date: 2009
Funder: Australian Research Council
View Funded ActivityStart Date: 2017
End Date: 2020
Funder: Australian Research Council
View Funded ActivityStart Date: 2014
End Date: 2017
Funder: Australian Research Council
View Funded ActivityStart Date: 02-2003
End Date: 12-2008
Amount: $793,510.00
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2002
End Date: 05-2006
Amount: $250,706.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2008
End Date: 12-2013
Amount: $407,558.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2006
End Date: 12-2007
Amount: $110,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 07-2006
End Date: 12-2009
Amount: $290,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 07-2011
End Date: 05-2015
Amount: $340,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2014
End Date: 12-2018
Amount: $320,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2017
End Date: 06-2021
Amount: $285,000.00
Funder: Australian Research Council
View Funded Activity