Timothy L. Urban
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Timothy L. Urban has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Panagiotis Kouvelis
Olin School of Business, Washington University, St. Louis, Missouri, 63130, USA
2 shared publications Wen-Chyuan Chiang
Operations Management, The University of Tulsa, Tulsa, OK, USA
2 shared publications- Wen-Chyuan Chiang
The University of Tulsa
2 shared publications Chunyong Luo
Spherexx.com, Tulsa, OK, USA
1 shared publicationPanagiotis Kouvelis
1 shared publicationR A Russell
The University of Tulsa Tulsa Oklahoma USA
1 shared publication
Latest Publications
- 30 December 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (5) , 1520-1534
Component ordering policies for selective assembly
Selective assembly is an approach in which high-precision assemblies can be produced from relatively low-precision components or subassemblies. This research investigates component ordering policies for fixed-bin selective-assembly processes that consider the stochastic nature of the binning process as well as stochastic demand. The distributional aspects of the assembly process are identified, and an approximation of the number of assemblies completed is provided utilising extreme-value theory. The order quantity can then be determined to meet demand with a given service level; an implicit-enumeration procedure is presented to illustrate this process. Computational results illustrate that this is an effective approach for controlling component inventories.
- 30 December 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (5) , 1520-1534
Component ordering policies for selective assembly
Selective assembly is an approach in which high-precision assemblies can be produced from relatively low-precision components or subassemblies. This research investigates component ordering policies for fixed-bin selective-assembly processes that consider the stochastic nature of the binning process as well as stochastic demand. The distributional aspects of the assembly process are identified, and an approximation of the number of assemblies completed is provided utilising extreme-value theory. The order quantity can then be determined to meet demand with a given service level; an implicit-enumeration procedure is presented to illustrate this process. Computational results illustrate that this is an effective approach for controlling component inventories.
- 9 September 2019
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 72 (1) , 23-34
Visualising newsvendor profits: the single-period problem with location-scale demand distributions
The single-period, or newsvendor, problem is typically formulated to maximise expected profits or minimise expected costs. Recent research has suggested that decision-makers tend not to act in accordance with this objective, and extensions to the model have been introduced that take into account other objectives, such as risk tolerance or achieving target profits. The purpose of this research is to provide decision support via visualisation to assist in the determination of an appropriate order quantity. A visual characterisation of the single-period profit distribution is provided for problems with location-scale demand distributions. From this, bounds on the profit as well as stochastically dominated solutions are identified, and the profit distribution is formulated as a mixture distribution of two extremes. This visualisation provides novel insight into the structure and alternative solution methods for single-period problems. Alternative decision criteria are then presented as a direct consequence of the visualisation, including quantile optimisation.
- 9 September 2019
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 72 (1) , 23-34
Visualising newsvendor profits: the single-period problem with location-scale demand distributions
The single-period, or newsvendor, problem is typically formulated to maximise expected profits or minimise expected costs. Recent research has suggested that decision-makers tend not to act in accordance with this objective, and extensions to the model have been introduced that take into account other objectives, such as risk tolerance or achieving target profits. The purpose of this research is to provide decision support via visualisation to assist in the determination of an appropriate order quantity. A visual characterisation of the single-period profit distribution is provided for problems with location-scale demand distributions. From this, bounds on the profit as well as stochastically dominated solutions are identified, and the profit distribution is formulated as a mixture distribution of two extremes. This visualisation provides novel insight into the structure and alternative solution methods for single-period problems. Alternative decision criteria are then presented as a direct consequence of the visualisation, including quantile optimisation.
- 15 December 2014
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (20) , 6232-6250
Balancing stochastic two-sided assembly lines
In a two-sided assembly line, tasks can be executed simultaneously on both sides of the line. One task cannot be started until both of its direct predecessors on the left and right sides are completed. Therefore, the start time of the task is the maximum of the two predecessors’ finish times. In many realistic situations, it is assumed that the task times are independent and normally distributed with known means and variances. However, the maximum of two normal variables is not normally distributed, but can be well approximated by results from extreme value theory. In this paper, we utilise these results to develop a solution methodology to balance two-sided assembly lines with stochastic task times, minimising the line length and the number of stations while guaranteeing all tasks are completed within the cycle time with a given confidence level.
- 15 December 2014
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (20) , 6232-6250
Balancing stochastic two-sided assembly lines
In a two-sided assembly line, tasks can be executed simultaneously on both sides of the line. One task cannot be started until both of its direct predecessors on the left and right sides are completed. Therefore, the start time of the task is the maximum of the two predecessors’ finish times. In many realistic situations, it is assumed that the task times are independent and normally distributed with known means and variances. However, the maximum of two normal variables is not normally distributed, but can be well approximated by results from extreme value theory. In this paper, we utilise these results to develop a solution methodology to balance two-sided assembly lines with stochastic task times, minimising the line length and the number of stations while guaranteeing all tasks are completed within the cycle time with a given confidence level.
- 1 July 2012
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (7) , 883-889
The existence of serial correlation and its effect on the format of a championship playoff series
- 1 July 2012
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 63 (7) , 883-889
The existence of serial correlation and its effect on the format of a championship playoff series
- 7 November 2008
- Published by Springer Nature in Annals of Operations Research
- Vol. 179 (1) , 131-147
The location and allocation of products and product families on retail shelves
- 7 November 2008
- Published by Springer Nature in Annals of Operations Research
- Vol. 179 (1) , 131-147
The location and allocation of products and product families on retail shelves
- 1 September 2008
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 59 (9) , 1220-1228
Vehicle routing with soft time windows and Erlang travel times
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 September 2008
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 59 (9) , 1220-1228
Vehicle routing with soft time windows and Erlang travel times
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 23 January 2007
- Published by Taylor & Francis in IIE Transactions
- Vol. 39 (4) , 347-359
Line balancing in a just-in-time production environment: balancing multiple U-lines
The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.
- 23 January 2007
- Published by Taylor & Francis in IIE Transactions
- Vol. 39 (4) , 347-359
Line balancing in a just-in-time production environment: balancing multiple U-lines
The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.
- 1 November 2006
- Published by Elsevier in European Journal of Operational Research
- Vol. 174 (3) , 1414-1426
Single- and multi-objective facility layout with workflow interference considerations
- 1 November 2006
- Published by Elsevier in European Journal of Operational Research
- Vol. 174 (3) , 1414-1426
Single- and multi-objective facility layout with workflow interference considerations
- 5 November 2004
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (7) , 1895-1906
A constraint programming approach to the multiple-venue, sport-scheduling problem
- 5 November 2004
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (7) , 1895-1906
A constraint programming approach to the multiple-venue, sport-scheduling problem
- 1 April 2002
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 48 (4) , 584-590
Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem
Although many authors have noted the importance of minimizing workflow interference in facility layout design, traditional layout research tends to focus on minimizing the distance-based transportation cost. This paper formalizes the concept of workflow interference from a facility layout perspective. A model, formulated as a quartic assignment problem, is developed that explicitly considers the interference of workflow. Optimal and heuristic solution methodologies are developed and evaluated.Facility Layout Analysis, Quartic Assignment Problem, Nonlinear Optimization, Heuristics
- 1 April 2002
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 48 (4) , 584-590
Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem
Although many authors have noted the importance of minimizing workflow interference in facility layout design, traditional layout research tends to focus on minimizing the distance-based transportation cost. This paper formalizes the concept of workflow interference from a facility layout perspective. A model, formulated as a quartic assignment problem, is developed that explicitly considers the interference of workflow. Optimal and heuristic solution methodologies are developed and evaluated.Facility Layout Analysis, Quartic Assignment Problem, Nonlinear Optimization, Heuristics