Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Algorithms for Solving Production-Scheduling Problems

Algorithms for Solving Production-Scheduling Problems Algorithms are developed for solving problems to minimize the length of production schedules. The algorithms generate anyone, or all, schedule(s) of a particular subset of all possible schedules, called the active schedules. This subset contains, in turn, a subset of the optimal schedules. It is further shown that every optimal schedule is equivalent to an active optimal schedule. Computational experience with the algorithms shows that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of all active schedules and, thus, to produce schedules that are optimal with a probability as close to unity as is desired. The basic algorithm can also generate the particular schedules produced by well-known machine loading rules. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Operations Research INFORMS

Algorithms for Solving Production-Scheduling Problems

Operations Research , Volume 8 (4): 17 – Aug 1, 1960
18 pages

Loading next page...
 
/lp/informs/algorithms-for-solving-production-scheduling-problems-xlB20iSBKN

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0030-364X
eISSN
1526-5463
DOI
10.1287/opre.8.4.487
Publisher site
See Article on Publisher Site

Abstract

Algorithms are developed for solving problems to minimize the length of production schedules. The algorithms generate anyone, or all, schedule(s) of a particular subset of all possible schedules, called the active schedules. This subset contains, in turn, a subset of the optimal schedules. It is further shown that every optimal schedule is equivalent to an active optimal schedule. Computational experience with the algorithms shows that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of all active schedules and, thus, to produce schedules that are optimal with a probability as close to unity as is desired. The basic algorithm can also generate the particular schedules produced by well-known machine loading rules.

Journal

Operations ResearchINFORMS

Published: Aug 1, 1960

There are no references for this article.