Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods
Tóm tắt
Từ khóa
Tài liệu tham khảo
Chang P-C, Liu C-H, Lai RK (2008) A fuzzy case-based reasoning model for sales forecasting in print circuit board industries. Expert Syst Appl 34:2049–2058
Chang PY, Damodaran P, Melouk S (2004) Minimizing makespan on parallel batch processing machines. Int J Prod Res 42:4211–4220
Chen TS, Long L, Fung RYK (2006) A genetic algorithm for the batch scheduling with sequence-dependent setup times. In: Thoma M, Morari M (eds) Intelligent computing in signal processing and pattern recognition. Springer, Berlin, pp 1137–1144
Cheng BW, Chang CL (2007) A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm. Expert Syst Appl 32:415–421
Chou FD (2007) A joint GA + DP approach for single burn-in oven scheduling problems with makespan criterion. Int J Adv Manuf Technol 35:587–595
Chou FD, Wang HM (2008) Scheduling for a single semiconductor batch processing machine to minimize total weighted tardiness. J Chin Inst Ind Eng 25:136–147
Chou FD, Chann CP, Wang HM (2006) A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int J Adv Manuf Technol 31:350–359
Damodaran P, Srihari K (2004) Mixed integer formulation to minimize makespan in a flowshop with batch processing machines. Math Comput Model 40:1465–1472
Damodaran P, Hirani NS, Mario C, Gallego V (2009) Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms. Eur J Ind Eng 3:187–206
Damodaran P, Manjeshwar PK, Srihari K (2006) Minimizing makespan on a batch processing machine with non-identical job sizes using genetic algorithms. Int J Prod Econ 103:882–891
Damodaran P, Srihari K, Lam S (2007) Scheduling a capacitated batch-processing machine to minimize makespan. Robot Cim-Int Manuf 23(2):208–216
Dong N, Wu CH, Ip W-H, Chen Z-Q, Yung K-L (2012) Chaotic species based particle swarm optimization algorithms and its application in PCB components detection. Expert Syst Appl 39:12501–12511
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York
Hadavandi E, Shavandi H, Ghanbari A (2012) An improved sales forecasting approach by the integration of genetic fuzzy systems and data clustering: case study of printed circuit board. Expert Syst Appl 38:9392–9399
Hajiaghaei-Keshteli M (2010) The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches. Appl Soft Comput 2:2069–2078
Hsu C-M (2010) PCB design improvement in the circuit between the north bridge and SDRAM through an integrated procedure. Expert Syst Appl 37:2978–2990
Kashan AH, Karimi B (2007) Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: an ant colony framework. J Oper Res Soc 59:1269–1280
Husseinzadeh Kashan A, Karimi B, Jenabi M (2008) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput Oper Res 35:1084–1098
Husseinzadeh Kashan A, Karimi B, Jolai F (2006) Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes. Int J Prod Res 44:2337–2360
Jolai F, Kor H, Hatefi SM, Iranmanesh H (2009) A genetic algorithm for Makespan minimization in a no-wait flowshop problem with two batching machines. International conference on computer engineering and technology
Koh SG, Koo PH, Kim DC, Hur WS (2005) Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. Int J Prod Econ 98(1):81–96
Koh SG, Koo PH, Ha JW, Lee WS (2004) Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families. Int J Prod Res 42:4091–4107
Liao CJ, Liao LM (2008) Improved MILP models for two-machine flowshop with batch processing machines. Math Comput Model 48:1254–1264
Liukkonen M, Havia E, Leinonen H, Hiltunen Y (2011) Expert system for analysis of quality in production of electronics. Expert Syst Appl 38:8724–8729
Liu S-T, Wang R-T (2009) Efficiency measures of PCB manufacturing firms using relational two-stage data envelopment analysis. Expert Syst Appl 36:4935–4939
Luo F, Sun H, Geng T, Qi N (2008) Application of Taguchi method in the optimisation of bridging efficiency between confluent and fresh micro carriers in bead-to-bead transfer of Vero cells. Biotechnol Lett 30:645–649
Malve S, Uzsoy R (2007) A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Comput Oper Res 34:3016–3028
Manjeshwar PK, Damodaran P, Srihari K (2009) Minimizing makespan in a flowshop with two batch processing machines using simulated annealing. Robot Com-Int Manuf 25:667–679
Mazumdar CS, Mathirajan M, Gopinath R, Sivakumar AI (2008) Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints. Inter J Oper Res 3:119–139
Melouk S, Damodaran P, Chang PY (2004) Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int J Prod Econ 87:141–147
Mokhtari H, Abadi INK, Zegordi SH (2011) Production capacity planning and scheduling in a no-wait environment with controllable processing times: an integrated modeling approach. Expert Syst Appl 38(10):12630–12642
Mönch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput Oper Res 32:2731–2750
Mönch L, Unbehaun R, Choung YI (2006) Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint. OR Spectr 28:177–198
Naderi B, Tavakkoli-Moghaddam R, Khalili M (2010) Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl Based Syst 23:77–85
Neammanee P, Randhawa SU (2003) Integrated methodology for board assignment and component allocation in printed circuit board assembly. Int J Prod Res 41(5):919–937
Noroozi A, Mokhtari H, Abadi INK (2012) A genetic programming guided search designed for production scheduling when batch processing machines are available. Adv Sci Lett 18:85–91
Oulamara A, Finke G, Kuiteing AK (2009) Flow shop scheduling problem with a batching machine and task compatibilities. Comput Oper Res 36(2):391–401
Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43(5):395–406
Rostamian Delavar M, Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S (2010) Genetic algorithms for coordinated scheduling of production and air transportation. Expert Syst Appl 37:8255–8266
Ruiz R, Stützle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187:1143–1159
Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem, Omega. Int J Manage Sci 278:461–476
Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165:34–54
Taguchi G, Konishi S (1987) Taguchi methods, orthogonal arrays and linear graphs, tools for quality American supplier institute. American Supplier Institute, pp 8–35
Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem. Expert Syst Appl 38:10812–10821
Wang CS, Uzsoy R (2002) A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput Oper Res 29:1621–1640
Wang HF, Chou FD (2010) Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Syst Appl 37:1510–1521
Wu Y, Wu A (2000) Taguchi methods for robust design. The American Society of Mechanical Engineers, The Park Avenue, New York