TL;DR: The solution approach includes several heuristic procedures to handle the subproblems which are formulated as assignment type problems in which entities are assigned to resources by using penalty terms for conflicts and excessive use of classrooms.

TL;DR: The conditions that determine which of a pair of adjacent jobs in a sequence should precede the other to minimize total job tardiness are derived and a branch-and-bound solution procedure to reach an optimal solution to the problem is developed.

TL;DR: The design and implementation of a computerized system for the routing of solid waste collection vehicles and the experiences in implementing this system in the Town of Oyster Bay, New York are presented.

TL;DR: It is demonstrated that the quasi-concave nonlinear multiple attribute utility function (MAUF) is more general and flexible than additive, multiplicative, and multilinear MAUFs and can be used to rank multiple criteria alternatives.

TL;DR: In this paper, a set of linear programming test problems is analyzed with MINOS, and the problems have been run with different options for scaling and partial pricing to illustrate the effects of these options on the performance of the simplex method.

TL;DR: It is pointed out that the bicriteria programming algorithm is not suitable for all bilevel programming problems in searching for optimal solutions and a sufficient condition is proposed to use the bICriteria Programming algorithm for solving a bileVEL programming problem.

TL;DR: A pseudopolynomial algorithm of order (n2X) is developed in this paper to generate the efficient frontier where X is the cardinality of the efficient Frontier for an n job problem.

TL;DR: The goal in this paper is to review the modeling language and mathematical programming features and user-interface anduser-control capabilities of this class of micro-based packages in order to determine how effective they are at modeling, managing, and solving NLPs.

TL;DR: The report reviews and analyzes the concept of productive capacity, identifies four capacities: nominal, available, actual, and idle, defines them precisely, and suggests approaches to their measurement.

TL;DR: It has been concluded that due to increasing automation requirements in manufacturing and the intensified organizational competitive environment, the decision making process itself will have to be automated and expert systems could be a vehicle in achieving this.

TL;DR: A combination of a “core” integer programming analysis with supporting simulation of stochastic outcomes allows an orderly search for the preferred cost-risk combination.

TL;DR: An efficient method for computing the steady state probabilities of a finite capacity queue with exponential service is presented and poisson arrivals, non-preemptive or preemptive-resume priority scheduling, and common or reserved waiting areas for high and low priority packets are presented.

TL;DR: Results of this study indicate that the procedures which employ squared cusum and nondiscounted cusu of innovations yield smaller rates of false detection, and the two best change-detection statistics appear to possess good potential for industrial and business forecast monitoring applications.

TL;DR: A zero-one goal programming approach that can consider all of the conflicting criteria and provide a satisficing solution to the journal cancellation problem is described.

TL;DR: An algorithm for finding approximate solutions to constrained shortest path problems whose arc lengths are random variables that employs a dynamic programming algorithm to solve fixed instances of the probabilistic problem within a simulation framework.

TL;DR: The conceptual framework and development strategy for an expert system in multi-project scheduling domains and a practical application of the scheduling system are presented.

TL;DR: A simple labeling algorithm to solve the assignment problem based on the maximum-flow formulation of the problem of finding the fewest number of lines to cover all zeros in the reduced assignment matrix is described.

TL;DR: An O(min{n0.5, m}mn log2 n) algorithm is designed to find an assignment which minimizes the maximum of Tj for 1⩽ j ⩽ m.

TL;DR: This paper considers a dynamic production/inventory problem where the yield (or quantity supplied) is not exactly equal to quantity ordered and proposes a heuristic that performs well in majority of the 8000 simulated test cases.

TL;DR: A class of simple heuristic algorithms for discrete dynamic lot size problems without backlogging is presented, which involves a simple eyeballing comparison of a predetermined sequence of cut-off values with the sequence of product demands.

TL;DR: The application of two decision support systems to the redesign of an MBA information technology course is described, one based on the Analysis of Interconnected Decision Areas technique and the other on the Analytic Hierarchy Process.

TL;DR: This paper illustrates how a decision support system (DSS), designed and employed as a “game-simulation” can be used to overcome many of these types of problems and can beused to enhance “change”.

TL;DR: ALTO is introduced, an interactive-graphic computer system designed to facilitate the development of routing algorithms for transportation vehicles that embodies a “general heuristic”, that is, a set of templates that are instantiated by an expert user with his/her own formulas in order to create specific algorithms.

TL;DR: How resource constrained project scheduling can be simulated on a distributed computer system is discussed and the distributed algorithm proposed has been illustrated by an example.

TL;DR: This paper deals with the development of an interactive procedure to generate a unique solution to a decision problem represented as a vector optimization problem and uses the concept of a displaced point, which captures the changes of reference experienced in most decision situations.

TL;DR: Warranty cost estimation for multiple products is considered, a goal programming approach is used to solve the formulated problem, and goal achievements are discussed.

TL;DR: In this paper, it was shown that using the entropy maximization procedure with only two service time moments is equivalent to using exponentially distributed service times in M/GI/1 queues.

TL;DR: A conceptual framework is proposed to develop a knowledge base scheduling system for a Prototype Flexible Manufacturing Cell and a framework of Expert Scheduling System (ESS) to provide an appropriate scheduling rule under the prevailing manufacturing environment.

TL;DR: An optimal mixed-integer programming formulation for the aggregate planning problem that explicitly specifies discrete variables is described, thus resulting in feasible workforce levels for crew-loaded production environments.