TITLE

AN ALGORITHM FOR SOLVING JOB SEQUENCING PROBLEMS

AUTHOR(S)
Presby, J.T.; Wolfson, M.L.
PUB. DATE
April 1967
SOURCE
Management Science;Apr1967, Vol. 13 Issue 8, pB-454
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The technique described in this paper was devised for sequencing jobs on individual machines having characteristics of: (1) high job changeover costs; (2) small backlogs (10-20 jobs); (3) occasional "rush" orders. The algorithm starts with four-job sequences and from these constructs five-job sequences; from the five-job sequences, six-job sequences are constructed, and so on. At each stage, a large fraction of sequences are eliminated from further consideration. This elimination process makes the computation feasible because the number of all possible sequences becomes unmanageably large, even for small problems. The technique always provides a minimum cost sequence. It also permits determination of optimum sequences of backlog sub-sets; thus, rush orders can be accommodated and anticipated changes in the job backlog can be recognized.
ACCESSION #
7028391

 

Related Articles

  • AN ALGORITHMIC SOLUTION TO TWO-STAGE TRANSFER LINES WITH POSSIBLE SCRAPPING OF UNITS. Shanthikumar, J.G.; Tien, C.C. // Management Science;Sep83, Vol. 29 Issue 9, p1069 

    An important aspect of the efficient design of an automatic transfer line is the ability to understand and predict the effects of the system parameters such as the size of the intermediate buffer storage space, the cycle times, failure times, repair times, and scrap rate, on the production rate...

  • OPTIMAL AND SYSTEM MYOPIC POLICIES FOR MULTI-ECHELON PRODUCTION/ INVENTORY ASSEMBLY SYSTEMS. Schwarz, Leroy B.; Schrage, Linus // Management Science;Jul1975, Vol. 21 Issue 11, p1285 

    In this paper optimal and near optimal policies are proposed for multi-echelon production/inventory assembly systems under continuous review with constant demand over an infinite planning horizon. Costs at each stage consist of a fixed charge per order or production setup plus a linear holding...

  • A MULTI-ITEM MAINTENANCE CENTER INVENTORY MODEL FOR LOW-DEMAND REPARABLE ITEMS. Schaefer, Margaret K. // Management Science;Sep83, Vol. 29 Issue 9, p1062 

    In many military and commercial contexts, complex equipment undergoes scheduled maintenance overhauls at regular intervals during which all failed components are replaced. Failure to have replacements on hand for all failed parts requires emergency measures at premium cost. When reparable parts...

  • Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations. Iravani, Seyed M.; Van Oyen, Mark P.; Sims, Katharine T. // Management Science;Feb2005, Vol. 51 Issue 2, p151 

    In this paper, we present a new perspective on flexibility in manufacturing and service operations by exploring a type of operational flexibility that we term "structural flexibility (SF)." We focus on strategic-level issues of how flexibility can be created by using multipurpose resources such...

  • AN ALGORITHM FOR THE CONSTRUCTION AND EVALUATION OF FEASIBLE SCHEDULES. Heller, Jack; Logemann, George // Management Science;Jan1962, Vol. 8 Issue 2, p168 

    An algorithm for the generation of feasible schedules and the computation of the completion times of the job operations of feasible schedule is presented. Using this algorithm, the distribution of schedule times over the set of feasible schedule--or a subset of feasible schedules--was determined...

  • INTEGER PROGRAMMING FORMULATION OF CONSTRAINED RELIABILITY PROBLEMS. Tillman, F.A.; Liittschwager, J.M. // Management Science;July67, Vol. 13 Issue 11, p887 

    This paper investigates the solution by integer programming of reliability optimization problems which are subject to linear and nonlinear separable restraints. In particular, the following problems are solved: (1) maximizing reliability for a parallel redundancy system subject to multiple...

  • TI CYCLES: NEW PRODUCT STRATEGY (A). Basant, Rakesh // Vikalpa: The Journal for Decision Makers;Jul-Sep2003, Vol. 28 Issue 3, p113 

    Presents an article which comments on the article "TI Cycles: New Product Strategy (A)," by Mukund R. Dixit and Abhinandan K. Jain which appeared in the first quarter 2003 issue of the periodical "Vikalpa." Analysis on the business and management context in which the TI Cycles company operates;...

  • RANDOMIZED REPLACEMENT RULES WHICH MAXIMIZE THE EXPECTED CYCLE LENGTH OF EQUIPMENT SUBJECT TO MARKOVIAN DETERIORATION. Kolesar, Peter // Management Science;July67, Vol. 13 Issue 11, p867 

    A problem of determining the form of optimal replacement policies is treated. Equipment whose changes of state can be described by a finite Markov chain are considered. The objective of the replacement policy is the maximization of the expected time between replacements while keeping the...

  • AGE REPLACEMENT UNDER ALTERNATIVE COST CRITERIA. Ansell, J.; Bendell, A.; Humble, S. // Management Science;Mar84, Vol. 30 Issue 3, p358 

    Due to the complexity of optimum replacement problems over finite time horizons various asymptotic criteria based upon fixed age replacement policies have been employed in the literature and in practice. In this paper the relationships between the optimum policies under three alternative cost...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics