메뉴 건너뛰기




Volumn 49, Issue 8, 1998, Pages 819-828

A simple and effective recursive procedure for the manufacturer’s pallet loading problem

Author keywords

Combinatorial analysis; Cutting stock problem; Heuristics; Manufacturer s pallet loading; Packing

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MICROCOMPUTERS; OPTIMIZATION; PACKING; PALLETS; RECURSIVE FUNCTIONS;

EID: 0032139363     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600588     Document Type: Article
Times cited : (57)

References (27)
  • 3
    • 0026885171 scopus 로고
    • Cutting and packing problems: A categorized, application-oriented research bibliography
    • Sweeney P and Paternoster E (1992). Cutting and packing problems: A categorized, application-oriented research bibliography. J Opl Res Soc 43: 691-706.
    • (1992) J Opl Res Soc , vol.43 , pp. 691-706
    • Sweeney, P.1    Paternoster, E.2
  • 4
    • 84984729551 scopus 로고
    • Special issue on cutting and packing
    • Bischoff E and Waescher G (eds) (1995). Special issue on cutting and packing. Eur J Opl Res 84: 503-712.
    • (1995) Eur J Opl Res , vol.84 , pp. 503-712
    • Bischoff, E.1    Waescher, G.2
  • 5
    • 0020177911 scopus 로고
    • A combined approach to the pallet loading problem
    • Hodgson T (1982). A combined approach to the pallet loading problem. IlE Trans 14: 176-182
    • (1982) Ile Trans , vol.14 , pp. 176-182
    • Hodgson, T.1
  • 6
    • 0027642328 scopus 로고
    • Packing problems
    • Dowsland K (1993). Packing problems. Eur J Opl Res 68: 389-399.
    • (1993) Eur J Opl Res , vol.68 , pp. 389-399
    • Dowsland, K.1
  • 7
    • 84952511820 scopus 로고
    • A systematic approach for the three-dimensional palletization problem
    • Abdou G and Yang M (1994). A systematic approach for the three-dimensional palletization problem. Int J Prod Res 32: 2381-2394.
    • (1994) Int J Prod Res , vol.32 , pp. 2381-2394
    • Abdou, G.1    Yang, M.2
  • 8
    • 0000088587 scopus 로고
    • An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
    • Arenales M and Morabito R (1995). An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. Eur J Opl Res 84: 599-617.
    • (1995) Eur J Opl Res , vol.84 , pp. 599-617
    • Arenales, M.1    Morabito, R.2
  • 9
    • 0029409958 scopus 로고
    • Loading multiple pallets
    • Bischoff E and Ratcliff M (1995). Loading multiple pallets. J OplRes Soc 46: 1322-1336.
    • (1995) J Oplres Soc , vol.46 , pp. 1322-1336
    • Bischoff, E.1    Ratcliff, M.2
  • 10
    • 38149143416 scopus 로고
    • An AND/OR-graph approach to the container loading problem
    • Morabito R and Arenales M (1994). An AND/OR-graph approach to the container loading problem. Int Trans Opl Res 1: 59-73.
    • (1994) Int Trans Opl Res , vol.1 , pp. 59-73
    • Morabito, R.1    Arenales, M.2
  • 11
    • 0025210672 scopus 로고
    • A typology of cutting and packing problems
    • Dychoff H (1990). A typology of cutting and packing problems. EurJ Opl Res 44: 145-159.
    • (1990) Eurj Opl Res , vol.44 , pp. 145-159
    • Dychoff, H.1
  • 12
    • 0029634664 scopus 로고
    • How to use structural constraints to compute an upper bound for the pallet loading problem
    • Nelissen J (1995). How to use structural constraints to compute an upper bound for the pallet loading problem. Eur J Opl Res 84: 662-680.
    • (1995) Eur J Opl Res , vol.84 , pp. 662-680
    • Nelissen, J.1
  • 13
    • 0020100102 scopus 로고
    • An application of the micro to product design and distribution
    • Bischoff E and Dowsland W (1982). An application of the micro to product design and distribution. J Opl Res Soc 33: 271-280.
    • (1982) J Opl Res Soc , vol.33 , pp. 271-280
    • Bischoff, E.1    Dowsland, W.2
  • 14
    • 0021789009 scopus 로고
    • An exact two-dimensional non-guillotine tree search procedure
    • Beasley J (1985). An exact two-dimensional non-guillotine tree search procedure. Opns Res 33: 49-64.
    • (1985) Opns Res , vol.33 , pp. 49-64
    • Beasley, J.1
  • 15
    • 0030123339 scopus 로고    scopus 로고
    • The G4-heuristic for the pallet loading problem
    • Scheithauer G and Terno J (1996). The G4-heuristic for the pallet loading problem. J Opl Res Soc 47: 511-522.
    • (1996) J Opl Res Soc , vol.47 , pp. 511-522
    • Scheithauer, G.1    Terno, J.2
  • 16
    • 0023384179 scopus 로고
    • An exact algorithm for the pallet loading problem
    • Dowsland K (1987). An exact algorithm for the pallet loading problem. Eur J Opl Res 31: 78-84.
    • (1987) Eur J Opl Res , vol.31 , pp. 78-84
    • Dowsland, K.1
  • 17
    • 0027633083 scopus 로고
    • Three dimensional palletization of mixed box sizes
    • Tsai R, Malstrom E and Kuo W (1993). Three dimensional palletization of mixed box sizes. IEE Trans 25: 64-75.
    • (1993) IEE Trans , vol.25 , pp. 64-75
    • Tsai, R.1    Malstrom, E.2    Kuo, W.3
  • 18
    • 0018529119 scopus 로고
    • Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem
    • Steudel H (1979). Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem. Mgmt Sci 10: 997-1004.
    • (1979) Mgmt Sci , vol.10 , pp. 997-1004
    • Steudel, H.1
  • 19
    • 0019044253 scopus 로고
    • An algorithm to optimize the layout of boxes in pallets
    • Smith A and De Cani P (1980). An algorithm to optimize the layout of boxes in pallets. J Opl Res Soc 31: 573-578.
    • (1980) J Opl Res Soc , vol.31 , pp. 573-578
    • Smith, A.1    De Cani, P.2
  • 20
    • 0037867939 scopus 로고
    • Solving the pallet loading problem more efficiently
    • Graduiertenkolleg Informatik und Technik, Aachen, August
    • Nelissen J (1994). Solving the pallet loading problem more efficiently. Working paper, Graduiertenkolleg Informatik und Technik, Aachen, August.
    • (1994) Working Paper
    • Nelissen, J.1
  • 21
    • 0004575159 scopus 로고
    • Packing the maximum number of m x n tiles in a large p x q rectangle
    • Barnes F (1979). Packing the maximum number of m x n tiles in a large p x q rectangle. Discrete Mathe 26: 93-100.
    • (1979) Discrete Mathe , vol.26 , pp. 93-100
    • Barnes, F.1
  • 22
    • 0000026164 scopus 로고
    • Recursive computational procedure for two dimensional stock cutting
    • Herz J (1972). Recursive computational procedure for two dimensional stock cutting. IBM J Res Develop 16: 462-469.
    • (1972) IBM J Res Develop , vol.16 , pp. 462-469
    • Herz, J.1
  • 24
    • 0021513214 scopus 로고
    • The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems
    • Dowsland K (1984). The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problems. J Opl Res Soc 35: 895-905.
    • (1984) J Opl Res Soc , vol.35 , pp. 895-905
    • Dowsland, K.1
  • 26
    • 11644321742 scopus 로고
    • Pallet loading configurations for optimal storage and shipping
    • December
    • Wright P (1984). Pallet loading configurations for optimal storage and shipping. Paperboard and Packing, December, 46-49.
    • (1984) Paperboard and Packing , pp. 46-49
    • Wright, P.1
  • 27
    • 0008017928 scopus 로고
    • Optimizagao do carregamento de paletes: Uma abordagem heurística para resolver o problema do produ- tor
    • Departamento de Engenharia de Produgao, Universidade Federal de Sao Carlos, Brazil
    • Morales S (1995). Optimizagao do carregamento de paletes: Uma abordagem heurística para resolver o problema do produ- tor. Dissertation, Departamento de Engenharia de Produgao, Universidade Federal de Sao Carlos, Brazil.
    • (1995) Dissertation
    • Morales, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.