Optimal Sequencing by Modular Decomposition: Polynomial Algorithms

We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of precedence constraints than previously realized. The algorithm's efficiency depends on the maximum number of jobs that are not related by the precedence constraints in certain subsets of the jobs. We also demonstrate how to modify this general algorithm lo take advantage of special problem characteristics.

[1]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[2]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[3]  Clyde L. Monma,et al.  Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions , 1987, Math. Oper. Res..

[4]  Edward P. C. Kao,et al.  On Dynamic Programming Methods for Assembly Line Balancing , 1982, Oper. Res..

[5]  Rolf H. Möhring,et al.  A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..

[6]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[7]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[8]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[9]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[10]  Charles J. Colbourn,et al.  Minimizing setups in ordered sets of fixed width , 1985 .

[11]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[12]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[13]  Jeffrey B. Sidney,et al.  A Decomposition Algorithm for Sequencing with General Precedence Constraints , 1981, Math. Oper. Res..

[14]  H. Simon,et al.  Optimal Strategies for a Class of Constrained Sequential Problems , 1977 .

[15]  Michel Habib,et al.  Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..

[16]  Kevin D. Glazebrook,et al.  On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs , 1981, Oper. Res..

[17]  Ivan Rival.  Optimal linear extensions by interchanging chains , 1983 .

[18]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[19]  George Steiner,et al.  Single Machine Scheduling with Precedence Constraints of Dimension 2 , 1984, Math. Oper. Res..