Aronson Jay E.

Jay E. Aronson

Information about the author Jay E. Aronson will soon be added to the site.
Found 10 papers in total
The impact of DSS use and information load on errors and decision quality
The impact of DSS use and information load on errors and decision quality
2007
This paper uses a laboratory experiment to examine the effect of DSS use on the...
A parallel branch-and-bound method for cluster analysis
A parallel branch-and-bound method for cluster analysis
1999
Cluster analysis is a generic term coined for procedures that are used objectively to...
A tabu search heuristic procedure for the fixed charge transportation problem
A tabu search heuristic procedure for the fixed charge transportation problem
1998
We develop a tabu search approach for the fixed charge transportation (FCT) problem...
An interactive reservoir management system for Lake Kariba
An interactive reservoir management system for Lake Kariba
1998
This paper presents a user-interactive decision support system (DSS) for managing of...
SPOT; Scheduling Programs Optimally for Television
SPOT; Scheduling Programs Optimally for Television
1998
This paper introduces SPOT (Scheduling Programs Optimally for Television), an...
The solution of multiperiod network models with bundle constraints by aggregation
The solution of multiperiod network models with bundle constraints by aggregation
1993
The authors present a new network aggregtion/disaggregation approach for solving a...
Optimal clustering: A model and method
Optimal clustering: A model and method
1991
Classifying items into distinct groupings is fundamental in scientific inquiry. The...
A natural starting strategy for Aronson’s heuristic 1 for solving the deterministic, single operator, multiple machine, multiple run cyclic scheduling problem
A natural starting strategy for Aronson’s heuristic 1 for solving the deterministic, single operator, multiple machine, multiple run cyclic scheduling problem
1987
The semiautomatic nature of machinery often makes it economical to assign more than...
A survey of dynamic network flows
A survey of dynamic network flows
1989
Dynamic network flow models describe network-structured, decision-making problems over...
A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems
A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems
1989
The minimum cost, multiperiod network flow problem is an optimization model that is...
Papers per page: