Scheduling to Minimize Interaction Cost

DOI10.1287/opre.14.1.52zbMath0139.13202OpenAlexW2043896070MaRDI QIDQ5514166

Nemhauser, George I., Robert C. Carlson

Publication date: 1966

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.14.1.52

zbMATH Keywords

operations research

Related Items

An asymptotically exact polynomial algorithm for equipartition problems, Dynamic programming and graph optimization problems, Adaptive differential dynamic programming for multiobjective optimal control, A comparison of several dynamic programming models of the made-to-order production situation, Sequential minimaxization under dynamic programming structure, The partition problem, Timetabling problem for university as assignment of activities to resources, THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS, Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints, Sensitivity analysis in discrete dynamic programming, A quadratic assignment problem without column constraints, Invariant imbedding and parallelism in dynamic programming for feedback control, Political districting: from classical models to recent approaches, A large scale timetabling problem, On a language for discrete dynamic programming and a microcomputer implementation, Some operations on dynamic programmings with one-dimensional state space, Exploiting sparsity for the min \(k\)-partition problem, Easy and hard bottleneck location problems, An improved algorithm for non-linear integer programming, A strong formulation for the graph partition problem, Register assignment in tree-structured programs, The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks, Bayesian birds: A simple example of Oaten's stochastic model of optimal foraging, Inverse theorem in dynamic programming. I, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime, Some comments on preference order dynamic programming models, Dynamical programming using singular perturbations, Multicriteria dynamic programming with an application to the integer case, The weighted perfect domination problem, Dynamic programming: An interactive approach, Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, The multiscenario lot size problem with concave costs., An interactive dynamic programming approach to multicriteria discrete programming, An exact approach for the multi-constraint graph partitioning problem, The bottleneck independent domination on the classes of bipartite graphs and block graphs., Political districting: From classical models to recent approaches, Scheduling activities among conflicting facilities to minimize conflict cost, Weighted graphs and university course timetabling, Finding a feasible course schedule using Tabu search, A two-level graph partitioning problem arising in mobile wireless communications, Projection results for the \(k\)-partition problem, A mathematical model and a metaheuristic approach for a memory allocation problem, On Markov policies for minimax decision processes, Using \(xQx\) to model and solve the uncapacitated task allocation problem, A dual algorithm for the one-machine scheduling problem, Optimal control of a birth-and-death process population model, Term-end exam scheduling at United States Military Academy/West Point, An exact algorithm for the concave transportation problem, The indefinite zero-one quadratic problem, Interactive fuzzy goal programming approach for bilevel programming problem, Multilevel decomposition of nonlinear programming problems by dynamic programming, A tool-change scheduling model for machining centres, Die Anwendung der Dynamischen Optimierung bei der Sozial-Sanitären Bezirkseinteilung, The concept of state in discrete dynamic programming, Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms, An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs, Dynamic programming applications to water resource system operation and planning, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem, Conditional decision processes with recursive function, Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs., Solvable classes of discrete dynamic programming, Monotonicity and the principle of optimality, Constructing a course schedule by solving a series of assignment type problems, Use of dynamic programming to accelerate convergence of directional optimization algorithms, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks, Ratio dynamic programs, A new look at Bellman's principle of optimality, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Tabu search for large scale timetabling problems, On \(n\)-stage, \(m\)-reusableness rate production planning problems, Optimization techniques in energy calculations involving the Hartree-Fock density matrix, A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming, On local search for the generalized graph coloring problem