Scheduling to Minimize Interaction Cost

Cited in

(74)

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

This page was built for publication: Scheduling to Minimize Interaction Cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514166)