Scotta A. Moses
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Scotta A. Moses has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Le Gruenwald
School of Computer Science, The University of Oklahoma, Norman, OK 73019, USA
2 shared publications Andres J. Lucas
University of Oklahoma
1 shared publicationH. Grant
University of Oklahoma
1 shared publicationJeffrey Starr
School of Computer Science, University of Oklahoma, Norman, OK, USA
1 shared publicationKelli R. Robinson
Insight Network Logistics , Auburn Hills, MI 48326, USA
1 shared publication- Khushru Dadachanji
School of Computer Science, The University of Oklahoma, Norman, USA
1 shared publication
Latest Publications
- 17 June 2008
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 19 (5) , 611-622
A scalable data structure for real-time estimation of resource availability in build-to-order environments
- 17 June 2008
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 19 (5) , 611-622
A scalable data structure for real-time estimation of resource availability in build-to-order environments
- 15 December 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (24) , 5391-5414
Effect of granularity of resource availability on the accuracy of due date assignment
In a make-to-order environment, order due dates can be assigned by consecutively estimating for each task on the order the time that the required resource will be available to perform the task. This paper examines the nature of the trade-off between the granularity of representation of resource availability, the resulting accuracy of due dates, and the computational time required to compute a due date. Granularity is defined as the size of the intervals of time (time buckets) over which available capacity is computed in a discrete-time representation of resource availability. The literature does not provide guidance on setting this important parameter, and typically it is arbitrarily set to one day or one week. Results compiled from extensive computations show consistent patterns of behaviour across all six combinations of values of experimental parameters for order size variability and system utilization. The resulting behaviour is classified into seven regions and analysed. Interestingly, results indicate that as granularity decreases the accuracy increases only up to a point, and the accuracy for very small granularities actually can be much worse than the accuracy of moderate granularities. From the results it can be concluded that when granularity is set to an appropriate value, resource availability will be estimated with relatively high accuracy and relatively low computational time, which are important performance characteristics for an order promising application.
- 15 December 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (24) , 5391-5414
Effect of granularity of resource availability on the accuracy of due date assignment
In a make-to-order environment, order due dates can be assigned by consecutively estimating for each task on the order the time that the required resource will be available to perform the task. This paper examines the nature of the trade-off between the granularity of representation of resource availability, the resulting accuracy of due dates, and the computational time required to compute a due date. Granularity is defined as the size of the intervals of time (time buckets) over which available capacity is computed in a discrete-time representation of resource availability. The literature does not provide guidance on setting this important parameter, and typically it is arbitrarily set to one day or one week. Results compiled from extensive computations show consistent patterns of behaviour across all six combinations of values of experimental parameters for order size variability and system utilization. The resulting behaviour is classified into seven regions and analysed. Interestingly, results indicate that as granularity decreases the accuracy increases only up to a point, and the accuracy for very small granularities actually can be much worse than the accuracy of moderate granularities. From the results it can be concluded that when granularity is set to an appropriate value, resource availability will be estimated with relatively high accuracy and relatively low computational time, which are important performance characteristics for an order promising application.
- 1 February 2005
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 16 (1) , 5-20
Scalability and performance of computational structures for real-time order promising
- 1 February 2005
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 16 (1) , 5-20
Scalability and performance of computational structures for real-time order promising
- 31 January 2005
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 48 (1) , 97-109
Scalability of indexing structures in a production systems testbed for computational research
- 31 January 2005
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 48 (1) , 97-109
Scalability of indexing structures in a production systems testbed for computational research
- 26 October 2004
- Published by SAGE Publications in Integrated Computer-Aided Engineering
- Vol. 11 (4) , 349-358
A scalable approach for estimation of resource availability using bitfields
Determining the time when a resource will be available to perform a task is a fundamental sub-problem in a variety of scheduling applications. This paper describes a model of resource capacity and an efficient representation that together facilitate
- 26 October 2004
- Published by SAGE Publications in Integrated Computer-Aided Engineering
- Vol. 11 (4) , 349-358
A scalable approach for estimation of resource availability using bitfields
Determining the time when a resource will be available to perform a task is a fundamental sub-problem in a variety of scheduling applications. This paper describes a model of resource capacity and an efficient representation that together facilitate
- 15 October 2004
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 42 (20) , 4353-4375
Real-time due-date promising by build-to-order environments
A vast amount of literature exists on scheduling to meet due dates, but very little work considers how to set these due dates before scheduling the orders. A method is described for real-time promising of order due dates that is applicable to discrete build-to-order environments facing dynamic order arrivals. When computing a due date, the method considers: (1) dynamic time-phased availability of resources required for each operation of the order, (2) individual order-specific characteristics and (3) existing commitments to orders that arrived previously. Performance of the method surpasses that of due-date assignment methods previously examined in the literature and also those commonly used in practice. The median and standard deviation of absolute flow-time estimation error and of absolute lateness are chosen as the primary performance criteria because they capture both positive and negative error in flow-time estimation of each individual order. Computational results from large-scale simulation studies of realistic systems with 20 resources and up to 100 000 orders also indicate the method is highly scalable.
- 15 October 2004
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 42 (20) , 4353-4375
Real-time due-date promising by build-to-order environments
A vast amount of literature exists on scheduling to meet due dates, but very little work considers how to set these due dates before scheduling the orders. A method is described for real-time promising of order due dates that is applicable to discrete build-to-order environments facing dynamic order arrivals. When computing a due date, the method considers: (1) dynamic time-phased availability of resources required for each operation of the order, (2) individual order-specific characteristics and (3) existing commitments to orders that arrived previously. Performance of the method surpasses that of due-date assignment methods previously examined in the literature and also those commonly used in practice. The median and standard deviation of absolute flow-time estimation error and of absolute lateness are chosen as the primary performance criteria because they capture both positive and negative error in flow-time estimation of each individual order. Computational results from large-scale simulation studies of realistic systems with 20 resources and up to 100 000 orders also indicate the method is highly scalable.