The Chain-Interchange Heuristic Method
The complexity of short schedules for uet bipartite graphs
The complexity of short schedules for uet bipartite graphs
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
The constrained gravity model with power function as a cost function.
The Construction of the Firm’S Performance Evaluation Model on Outsourcing Activities - Application of the Fuzzy Synthesis
The determination of direct control algorithms activation moments using a real-time scheduling algorithm
The determination of surgical suite capacity and an evaluation of patient scheduling policies
The disjoint cliques problem
The Distribution of Time for Clark’S Flow and Risk Assessment for the Activities of Pert Network Structure
The Effects of Majority in Fermat-Weber Problems With Attraction and Repulsion in a Pseudometric Space
The empirical TES methodology: Modeling empirical time series.
The Flow Networks Approach to Decision Analysis in Construction Industry
The formation of a tree leaf
In this article, we build a mathematical model to understand the formation of a tree leaf. Our model is based on the idea that a leaf tends to maximize internal efficiency by developing an efficient transport system for transporting water and nutrients. The meaning of “the efficient transport system” may vary as the type of the tree leave varies. In this article, we will demonstrate that tree leaves have different shapes and venation patterns mainly because they have adopted different efficient...
The generalized Weber problem with expected distances
The Hamiltonian -median problem.
The hotel overbooking problem
The inverse carrier problem
The problem was motivated by Borůvka’s definitions of the carrier and the associated carrier. The inverse carrier problem is precisely defined and partially solved. Examples are given.
The Inverse Maximum Flow Problem With Lower and Upper Bounds for the Flow
The joint determination of price, quality, and capacity: An application to supermarket operations.
The labeling method on two-dimensional networks