Wiley
0028-1441
1931-9193
Cơ quản chủ quản: N/A
Các bài báo tiêu biểu
The Hungarian method for the assignment problem
Tập 2 Số 1-2 - Trang 83-97 - 1955
AbstractAssuming that numerical scores are available for the performance of each
of n persons on each of n jobs, the “assignment problem” is the quest for an
assignment of persons to jobs so that the sum of the n scores so obtained is as
large as possible. It is shown that ideas latent in the work of two Hungarian
mathematicians may be exploited to yield a new method of solving this problem.
Optimal two‐ and three‐stage production schedules with setup times included
Tập 1 Số 1 - Trang 61-68 - 1954
AbstractEach of a collection of items are to be produced on two machines (or
stages). Each machine can handle only one item at a time and each item must be
processed through machine one and then through machine two. The setup time plus
work time for each item for each machine is known. A simple decision rule is
obtained in this paper for the optimal scheduling of the production so that the
total e...
Using simulated annealing to solve routing and location problems
Tập 33 Số 2 - Trang 261-279 - 1986
AbstractIn recent papers by Kirkpatrick et al., an analogy between the
statistical mechanics of large multivariate physical systems and combinatorial
optimization has been presented and used to develop a general strategy for
solving discrete optimization problems. The method relies on probabilistically
accepting intermediate increases in the objective function through a set of
user‐controlled para...
Numerical treatment of a class of semi‐infinite programming problems
Tập 20 Số 3 - Trang 477-504 - 1973
AbstractMany optimization problems occur in both theory and practice when one
has to optimize an objective function while an infinite number of constraints
must be satisfied. The aim of this paper in to describe methods of handling such
problems numerically in an effective manner. We also indicate a number of
applications.
Scheduling stochastic jobs on a single machine subject to breakdowns
Tập 31 Số 2 - Trang 251-264 - 1984
AbstractA single machine is available to process a collection of stochastic
jobs. There may be technological constraints on the job set. The machine
sometimes breaks down. Costs are incurred and rewards are earned during
processing. We seek strategies for processing the jobs which maximize the total
expected reward earned.
On estimating population characteristics from record‐breaking observations. i. parametric results
Tập 33 Số 3 - Trang 531-543 - 1986
AbstractConsider an experiment in which only record‐breaking values (e.g.,
values smaller than all previous ones) are observed. The data available may be
represented as X1,K1,X2,K2, …, where X1,X2, … are successive minima and K1,K2, …
are the numbers of trials needed to obtain new records. We treat the problem of
estimating the mean of an underlying exponential distribution, and we consider
both f...
Optimal reject allowance with constant marginal production efficiency
Tập 24 Số 1 - Trang 21-33 - 1977
AbstractA job shop must fulfill an order for N good items. Production is
conducted in “lots,” and the number of good items in a lot can be accurately
determined only after production of that lot is completed. If the number of good
items falls short of the outstanding order, the shop must produce further lots,
as necessary.Processes with “constant marginal production efficiency” are
investigated. T...