Supply chain for a high stakes testing agency

Authors:
Ronald Armstrong;Dmitry Belov;Mabel Kung
Affiliations:
Management Science and Information Systems, Rutgers University, Newark, NJ;Psychometric Research, Law School Admission Council, Newtown, PA;Information Systems and Decision Sciences, California State University at Fullerton, Fullerton, CA
Venue:
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Year:
2007

Citing 5
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

Computational Optimization and Applications
A model and a performance measurement system for collaborative supply chains

Decision Support Systems
Developing and Assembling the Law School Admission Test

Interfaces
An algorithm for finding a maximum clique in a graph

Operations Research Letters

Quantified Score

Hi-index	0.02

Visualization

Abstract

A valuable resource for any testing agency is the item pool which yields the questions for its tests. This paper considers the problem of developing the supply chain that provides these items. In particular, the life cycle of items used in the Law School Admission Test (LSAT) is reviewed. Guidelines for the optimal development of items over a finite horizon are given. The assembly of the tests and the problems associated with supply chain development will be formulated as integer programming models. All problems will be solved with commercially available software.