Bin covering algorithms in the second stage of the lot to order matching problem

Journal of the Operational Research Society

Volumn 52, Issue 11, 2001, Pages 1232-1243

  Carlyle, M ^a   Knutson, K ^a   Fowler, J ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Bin covering; Heuristics; Linear programming; Semiconductor manufacturing

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

DATA SETS;

SEMICONDUCTOR DEVICE MANUFACTURE;

EID: 0035506641     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601222     Document Type: Article

References (29)

1. Frederix F (1996). Planning and scheduling multi-site semi¬conductor production chains: a survey of needs, current prac¬tices and integration issues. In: Browne J, Haendler Mas R and Hlodversson O (eds.) Advances in Design and Manufacturing, vol 7. IT and Manufacturing Partnerships. OS Press: Amster¬dam, pp 107-116.
2. Knutson K, Kempf K, Fowler JW and Carlyle M (1999). Lot-to- order matching for a semiconductor assembly & test facility. IIE Trans Sched Logist 31: 1103-1111.
3. Fowler J, Knutson K and Carlyle M (2000). Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility. Int J Prod Res 38: 1841-1853.
4. Van Zant P (1990). Microchip Fabrication: A Practical Guide to Semiconductor Processing. McGraw-Hill: New York.
5. Dantzig GB (1957). Discrete-variable extremum problems. Opns Res 5: 266-277.
6. Garey MR and Johnson DS (1979). Computers and Intract¬ability: A Guide to the Theory ofNP-Completeness. WH Free¬man and Company: San Francisco.
7. Nemhauser GL and Wolsey LA (1988). Integer and Combina¬torial Optimization. John Wiley & Sons: New York.
8. Martello S and Toth P (1990). Knapsack Problems—Algorithms and Computer Implementations. John Wiley & Sons: Chichester.
9. Pisinger, D and Toth P (1998). Knapsack problems. In: Du D-Z and Pardalos P (eds). Handbook of Combinatorial Optimiza¬tion, Kluwer: Amsterdam.
10. Smith SP et al (1996). AutoPlan: planning and scheduling semiconductor assembly/test operations using simulation. Unpublished paper presented at SEMICON West 1996. (Avail¬able from author.)
11. Van De Vel, H and Shijie S (1991). An application of the bin¬packing technique to job scheduling on uniform processors. J OplResSoc 42: 169-172.
12. Brusco MJ, Thompson GM and Jacobs LW (1997). A morph- based simulated annealing heuristic for a modified bin-packing problem. J Opl Res Soc 48: 433-439.
13. Vasko FJ, McNamara JA, Newhart DD and Wolf FE (1994). A practical solution to a cargo loading problem at Bethlehem Steel. J Opl Res Soc 45: 1285-1292.
14. Bischoff E and Marriott MD (1990). A comparative evaluation of heuristics for container loading. Eur J Opl Res 44: 267-276.
15. Haessler RW and Sweeney PE (1991). Cutting stock problems and solution procedures. Eur J Opl Res 54: 141-50.
16. Dowsland K and Dowsland W (1992). Packing problems. Eur J Opl Res 56: 2-14.
17. Sweeney PE and Paternoster ER (1992). Cutting and packing problems: a categorized, application-orientated research biblio¬graphy. J Opl Res Soc 43: 691-706.
18. Dell’Amico M, Maffioli F and Martello S (1997). Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons: Chichester.
19. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145-159.
20. Assman SF, Johnson DS, Kleitman D and Leung J (1984). On a dual version of the one-dimensional bin packing problem. J Algorithms 5: 502-525.
21. Han S (1992). Probabilistic analyses of some scheduling and packing heuristic algorithms. Doctorial dissertation, The University of Texas at Dallas.
22. Coffman E and Shor P (1990). Average-case analysis of cutting and packing in two dimensions. Eur J Opl Res 44: 134-145.
23. Veress G, Almasy G and Pallai I (1973). On the solution of large-scale problems by decomposition. In: Himmelblau D (ed). Decomposition of Large-scale Problems. North-Holland: Amsterdam, pp 141-151.
24. Johnson D (1974). Fast algorithms for bin packing. J Comput SystSci 8: 272-314.
25. Pritsker AAB (1995). Introduction to Simulation and SLAM 2. John Wiley & Sons: New York.
26. Montgomery DC (1997). Design and Analysis of Experiments. John Wiley & Sons: New York.
27. McGeoch C (1986). Experimental analysis of algorithms. PhD thesis. Carnegie Mellon University.
28. Crary S and Spera C (1996). Optimal experimental design for combinatorial problems. Comput Econ 9: 241-255.
29. Design-Expert 5 (1996). Stat-Ease Corporation. 2021 East Hennepin Ave., Suite 191, Minneapolis, MN 55413, USA.