메뉴 건너뛰기




Volumn 56, Issue 12, 2005, Pages 1448-1451

A note on an L-approach for solving the manufacturer's pallet loading problem

Author keywords

Cutting and packing; Implementation; Pallet and container loading; Recursive algorithm

Indexed keywords

NUMBER THEORY; NUMERICAL ANALYSIS; PROBLEM SOLVING; PROJECT MANAGEMENT;

EID: 27844475718     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601960     Document Type: Conference Paper
Times cited : (20)

References (14)
  • 1
    • 0012099838 scopus 로고
    • A polynomialtime algorithm for the guillotine pallet loading problem
    • Tarnowski A, Terno J and Scheithauer G (1994). A polynomialtime algorithm for the guillotine pallet loading problem. INFOR 32: 275-287.
    • (1994) INFOR , vol.32 , pp. 275-287
    • Tarnowski, A.1    Terno, J.2    Scheithauer, G.3
  • 2
    • 0023384179 scopus 로고
    • An exact algorithm for the pallet loading problem
    • Dowsland KA (1987). An exact algorithm for the pallet loading problem. Eur J Opl Res 84: 78-84.
    • (1987) Eur J Opl Res , vol.84 , pp. 78-84
    • Dowsland, K.A.1
  • 3
    • 0029634664 scopus 로고
    • How to use the structural constraints to compute an upper bound for the pallet loading problem
    • Nelissen J (1995). How to use the 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
  • 4
    • 0037867939 scopus 로고
    • Solving the pallet loading problem more efficiently
    • Graduiertenkolleg Informatik und Technik, Aachen
    • Nelissen J (1994). Solving the pallet loading problem more efficiently. Working paper, Graduiertenkolleg Informatik und Technik, Aachen.
    • (1994) Working Paper
    • Nelissen, J.1
  • 5
    • 0035427778 scopus 로고    scopus 로고
    • Analysis of upper bounds for the pallet loading problem
    • Letchford A and Amaral A (2001). Analysis of upper bounds for the pallet loading problem. Eur J Opl Res 132: 582-593.
    • (2001) Eur J Opl Res , vol.132 , pp. 582-593
    • Letchford, A.1    Amaral, A.2
  • 6
    • 0037480767 scopus 로고    scopus 로고
    • An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces
    • Lins L, Lins S and Morabito R (2003). An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces. J Opl Res Soc 54: 777-789.
    • (2003) J Opl Res Soc , vol.54 , pp. 777-789
    • Lins, L.1    Lins, S.2    Morabito, R.3
  • 7
    • 23444451755 scopus 로고    scopus 로고
    • Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
    • to appear. DOI:10.1016/J.COR.2004.08.009
    • Pureza V and Morabito R (2004). Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem. Comput Opns Res to appear. DOI:10.1016/J.COR.2004.08.009.
    • (2004) Comput Opns Res
    • Pureza, V.1    Morabito, R.2
  • 9
    • 15244351839 scopus 로고    scopus 로고
    • A tabu search algorithm for the pallet loading problem
    • Alvarez-Valdes R, Parreño F and Tamarit JM (2005). A tabu search algorithm for the pallet loading problem. OR Spectrum 27: 43-61.
    • (2005) OR Spectrum , vol.27 , pp. 43-61
    • Alvarez-Valdes, R.1    Parreño, F.2    Tamarit, J.M.3
  • 10
    • 0032139363 scopus 로고    scopus 로고
    • A simple and effective recursive procedure for the manufacturer's pallet loading problem
    • Morabito R and Morales S (1998). A simple and effective recursive procedure for the manufacturer's pallet loading problem. J Opl Res Soc 49: 819-828.
    • (1998) J Opl Res Soc , vol.49 , pp. 819-828
    • Morabito, R.1    Morales, S.2
  • 11
    • 0033827839 scopus 로고    scopus 로고
    • Loading optimization of palletized products on trucks
    • Morabito R, Morales S and Widmer J (2000). Loading optimization of palletized products on trucks. Transport Res (Part E) 36: 285-296.
    • (2000) Transport Res (Part E) , vol.36 , pp. 285-296
    • Morabito, R.1    Morales, S.2    Widmer, J.3
  • 12
    • 2942602904 scopus 로고    scopus 로고
    • Phorma: Perfectly hashable order restricted multidimensional arrays
    • Lins L, Lins S and Melo S (2004). Phorma: perfectly hashable order restricted multidimensional arrays. Discrete Appl Math 141: 209-223.
    • (2004) Discrete Appl Math , vol.141 , pp. 209-223
    • Lins, L.1    Lins, S.2    Melo, S.3
  • 14
    • 27844455269 scopus 로고    scopus 로고
    • www.ime.usp.br/~egbirgin.


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