Multi-job Cutting Stock Problem with Due Dates and Release Dates
暂无分享,去创建一个
[1] A. Kolen. Combinatorial optimization algorithm and complexity: Prentice-Hall, Englewood Cliffs, 1982, 496 pages, $49.50 , 1983 .
[2] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[3] Jan Karel Lenstra,et al. A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..
[4] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[5] A. Farley,et al. Trim-loss pattern rearrangement and its relevance to the flat-glass industry , 1983 .
[6] Antonio Albano,et al. A Solution of the Rectangular Cutting-Stock Problem , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[7] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[8] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..
[9] R. Dyson,et al. The Cutting Stock Problem in the Flat Glass Industry , 1974 .
[10] William L. Maxwell,et al. Theory of scheduling , 1967 .
[11] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[12] Boon J. Yuen. Heuristics for sequencing cutting patterns , 1991 .
[13] Alan Farley. Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations , 1990 .
[14] Linus Schrage,et al. Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..
[15] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[16] W. A. Horn. Some simple scheduling algorithms , 1974 .
[17] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[18] Oli B. G. Madsen. Glass cutting in a small firm , 1979, Math. Program..
[19] Ram Mohan V. Rachamadugu. Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..
[20] A. Farley. Mathematical Programming Models for Cutting-Stock Problems in the Clothing Industry , 1988 .
[21] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[22] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[23] Hirofumi Matsuo,et al. A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .
[24] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[25] Esther M. Arkin,et al. Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..
[26] A. Farley,et al. A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions , 1983 .
[27] Oli B.G. Madsen. An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry , 1988 .
[28] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..
[29] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[30] Jan Karel Lenstra,et al. Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..
[31] M. L. Chambers,et al. The Cutting Stock Problem in the Flat Glass Industry - Selection of Stock Sizes , 1976 .
[32] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .