Wiley
0028-1441
1931-9193
Cơ quản chủ quản: N/A
Lĩnh vực:
Các bài báo tiêu biểu
The Hungarian method for the assignment problemAbstract Assuming 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 meth...
Tập 2 Số 1-2 - Trang 83-97 - 1955
Optimal two‐ and three‐stage production schedules with setup times includedAbstract Each 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 t... ...
Tập 1 Số 1 - Trang 61-68 - 1954
Using simulated annealing to solve routing and location problemsAbstract In 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 thro... ...
Tập 33 Số 2 - Trang 261-279 - 1986
Numerical treatment of a class of semi‐infinite programming problemsAbstract Many 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.
Tập 20 Số 3 - Trang 477-504 - 1973
Scheduling stochastic jobs on a single machine subject to breakdownsAbstract A 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.
Tập 31 Số 2 - Trang 251-264 - 1984
On estimating population characteristics from record‐breaking observations. i. parametric resultsAbstract Consider 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 X 1 ,K 1 ,X 2 ,K 2...
Tập 33 Số 3 - Trang 531-543 - 1986
Optimal reject allowance with constant marginal production efficiencyAbstract A 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. ...
Tập 24 Số 1 - Trang 21-33 - 1977