Multi-job cutting stock problem with due dates and release dates

Journal of the Operational Research Society

Volumn 47, Issue 4, 1996, Pages 490-510

  Li, Shanling ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Cutting stock; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING;

CUTTING STOCK; DUE DATES; RELEASE DATES;

OPERATIONS RESEARCH;

EID: 0030123408     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.56     Document Type: Article

References (36)

1. P. C. Gilmore and R. E. Gomory (1961) A linear programming approach to the cutting-stock problem, Part I. Opns Res. 9, 849-859.
2. P. C. Gilmore and R. E. Gomory (1963) A linear programming approach to the cutting-stock problem, Part II. Opns Res. 11, 863-888.
3. P. C. Gilmore and R. E. Gomory (1965) Multistage cutting-stock problems of two and more dimensions. Opns Res. 13, 94-120.
4. P. C. Gilmore and R. E. Gomory (1966) The theory and computation of knapsack functions. Opns Res. 14, 1045-1074.
5. R. G. Dyson and A. S. Gregory (1974) The cutting stock problem in the flat glass industry. Opl Res. Q. 25, 41-53.
6. M. Adamowicz and A. Albano (1976) A solution of the rectangular cutting-stock problem. IEEE Trans. Systems, Man. and Cybernetics. 6, 302-310.
7. M. L. Chambers and R. G. Dyson (1976) The cutting stock problem in the flat glass industry-selection of stock sizes. Opl Res. Q. 27, 949-957.
8. A. A. Farley (1983a) Trim-loss pattern rearrangement and its relevance to the flat-glass industry. Eur. J. Opl Res. 14, 386-392.
9. A. A. Farley (1983b) A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions. Eur. J. Opl Res. 14, 393-395.
10. A. A. Farley (1985) Algorithms for solving cutting stock problems. PhD Thesis., Monash University, Melbourne, Australia.
11. A. A. Farley (1988) Mathematical programming models for cutting stock problems in the clothing industry. J. Opl Res. Soc. 39, 41-53.
12. A. A. Farley (1990) Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations. Eur. J. Opl Res. 44, 247-255.
13. P. Y. Wang (1983) Two algorithms for constrained two-dimensional cutting stock problems. Eur. J. Opl Res. 28, 139-149.
14. B. J. Yuen (1991) Heuristics for sequencing cutting patterns. Eur. J. Opl Res. 55, 183-190.
15. O. B. G. Madsen (1979) Glass cutting in a small firm. Math. Prog. 17, 85-90.
16. O. B. G. Madsen (1988) An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. J. Opl Res. Soc. 39, 249-256.
17. E. L. Lawler (1977) A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331-342.
18. J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker (1977) Complexity of machine scheduling problem. Ann. Discrete Math. 1, 343-362.
19. S. E. Elmaghraby (1968) The one-machine sequencing with delay costs. J. Indust. Engrg. 19, 105-108.
20. H. Emmons (1969) One-machine sequencing to minimize certain functions of job tardiness. Opns Res. 17, 701-715.
21. J. Shwimer (1972) On the N-jobs, one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-and-bound solution. Mgmt Sci. 18B, 301-313.
22. A. H. G. Rinnooy Kan, B. J. Lageweg and J. K. Lenstra (1975) Minimizing total costs in one-machine scheduling. Opns Res. 23, 908-927.
23. R. M. V. Rachamadugu (1987) A note on the weighted tardiness problem’, Opns Res. 35, 450-452.
24. K. R. Baker and L. E. Schrage (1978) Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks. Opns. Res. 26, 111-120.
25. M. J. K. Lenstra and A. H. G. Rinnooy Kan (1985) Sequencing and Scheduling. In Combinatorial Optimization: Annotated Bibliographies. (M. O’Iieigeartaigh, J. K. Lenstra and A. H. G. Rinnooy Kan, Eds.) pp 164-189. Wiley, New York.
26. T. E. Morton, R. M. Rachamadugu and A. Vepsalainen (1984) Accurate Mypopic Heuristic for Tardiness Scheduling. Working Paper # 36-83-84, Carnegie Mellon University, Pittsburgh.
27. E. M. Erkin and R. O. Roundy (1991) Weighted-tardiness scheduling on parallel machines with proportional weights. Opns Res. 39, 64-81.
28. R. W. Conway, W. L. Maxwell and L. W. Miller (1967) Theory of Scheduling. Addison-Wesley, Reading, MA.
29. C. H. Papadimitriou and K. Steiglitz (1982) Combinatorial Optimization: Algorithm and Complexity. Prentice-Hall., Englewood Cliffs, NJ.
30. N. Metropolis, M. Rosenbluth, A. Rosenbluth, A. Teller and E. Teller (1953) Equation of state calculations by fast computing machines. J. Chem Phys. 21, 1087-1092.
31. P. J. M. Van Laarhoven, E. H. L. Aarts and J. K. Lenstra (1992) Job shop scheduling by simulated annealing. Opns Res. 40, 113-125.
32. E. H. L. Aarts, P. J. M. Van Laarhoven, J. K. Lenstra and N. L. J. Ulder (1994) A computational study of local search algorithms for job shop scheduling. ORSA J. Comput. 6, 118-125.
33. R. J. M. Vaessens, E. H. L. Aarts and J. K. Lenstra (1996) Job shop scheduling by local search, to appear in Math. Prog. B.
34. P. J. M. Van Laarhoven and E. H. L. Aarts (1987) Simulated Annealing: Theory and Applications. D. Reidel, Dordrecht.
35. H. Matsuo, C. J. Suh and R. S. Sullivan (1989) A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann. Opns Res. 21, 91-115.
36. W. A. Horn (1974) Some simple scheduling algorithms. Naval Res. Logist. Q. 21, 846-847. Received July 1994; accepted August 1995 after two revisions