메뉴 건너뛰기




Volumn 32, Issue 11, 2005, Pages 2731-2750

Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Author keywords

Batching; Genetic algorithms; Parallel machines; Scheduling; Semiconductor manufacturing

Indexed keywords

DECISION THEORY; DIFFUSION; GENETIC ALGORITHMS; HEURISTIC METHODS; OXIDATION; PARAMETER ESTIMATION; SCHEDULING; SEMICONDUCTOR DEVICES;

EID: 13844256873     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.04.001     Document Type: Article
Times cited : (192)

References (30)
  • 1
    • 0032003105 scopus 로고    scopus 로고
    • Minimizing total tardiness on a batch processing machine with incompatible job families
    • Mehta S.V., Uzsoy R. Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions. 30:1998;165-178
    • (1998) IIE Transactions , vol.30 , pp. 165-178
    • Mehta, S.V.1    Uzsoy, R.2
  • 2
    • 77957077792 scopus 로고
    • A "pseudopolynomial" time algorithm for sequencing jobs to minimize total weighted tardiness
    • Lawler E.L. A "pseudopolynomial" time algorithm for sequencing jobs to minimize total weighted tardiness. Annals of Discrete Mathematics. 1:1977;331-342
    • (1977) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 3
    • 4544293356 scopus 로고    scopus 로고
    • Minimizing total weighted tardiness on a single batch process machine with incompatible job families
    • to appear. DOI:10.1016/S0305-0548(03)00239-9
    • Perez TI, Fowler JW, Carlyle WM. Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Computers and Operations Research, to appear. DOI: 10.1016/S0305-0548(03)00239-9
    • Computers and Operations Research
    • Perez, T.I.1    Fowler, J.W.2    Carlyle, W.M.3
  • 4
    • 0035308563 scopus 로고    scopus 로고
    • Scheduling a batch processing machine with incompatible job families
    • Azizoglu M., Webster S. Scheduling a batch processing machine with incompatible job families. Computers and Industrial Engineering. 39(3-4):2001;325-335
    • (2001) Computers and Industrial Engineering , vol.39 , Issue.3-4 , pp. 325-335
    • Azizoglu, M.1    Webster, S.2
  • 6
    • 0036604740 scopus 로고    scopus 로고
    • Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
    • Dupont L., Dhaenens-Flipo C. Minimizing the makespan on a batch machine with non-identical job sizes. an exact procedure Computers and Operations Research. 29(7):2002;807-819
    • (2002) Computers and Operations Research , vol.29 , Issue.7 , pp. 807-819
    • Dupont, L.1    Dhaenens-Flipo, C.2
  • 7
    • 0036778940 scopus 로고    scopus 로고
    • A genetic algorithm to minimize maximum lateness on a batch processing machine
    • Wang C., Uzsoy R. A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research. 29(12):2002;1621-1640
    • (2002) Computers & Operations Research , vol.29 , Issue.12 , pp. 1621-1640
    • Wang, C.1    Uzsoy, R.2
  • 9
    • 1542685255 scopus 로고    scopus 로고
    • Genetic algorithm based scheduling of parallel batch machines with incompatible families to minimize total weighted tardiness
    • Balasubramanian H., Mönch L., Fowler J.W., Pfund M.E. Genetic algorithm based scheduling of parallel batch machines with incompatible families to minimize total weighted tardiness. International Journal of Production Research. 42(8):2004;1621-1638
    • (2004) International Journal of Production Research , vol.42 , Issue.8 , pp. 1621-1638
    • Balasubramanian, H.1    Mönch, L.2    Fowler, J.W.3    Pfund, M.E.4
  • 13
    • 0034135518 scopus 로고    scopus 로고
    • Control of multi-product bulk-server diffusion/oxidation processes part two: Multiple servers
    • Fowler J.W., Hogg G.L., Phillips D.T. Control of multi-product bulk-server diffusion/oxidation processes part two. multiple servers IIE Transactions on Scheduling and Logistics. 32(2):2000;167-176
    • (2000) IIE Transactions on Scheduling and Logistics , vol.32 , Issue.2 , pp. 167-176
    • Fowler, J.W.1    Hogg, G.L.2    Phillips, D.T.3
  • 14
    • 0029341463 scopus 로고
    • The use of upstream and downstream information in scheduling semiconductor batch operations
    • Robinson J.K., Fowler J.W., Bard J.F. The use of upstream and downstream information in scheduling semiconductor batch operations. International Journal of Production Research. 33(7):1995;1849-1869
    • (1995) International Journal of Production Research , vol.33 , Issue.7 , pp. 1849-1869
    • Robinson, J.K.1    Fowler, J.W.2    Bard, J.F.3
  • 15
  • 16
    • 0031514083 scopus 로고    scopus 로고
    • Stochastic scheduling of a batch processing machine with incompatible job families
    • Duenyas I., Neale J.J. Stochastic scheduling of a batch processing machine with incompatible job families. Annals of Operations Research. 70:1997;191-220
    • (1997) Annals of Operations Research , vol.70 , pp. 191-220
    • Duenyas, I.1    Neale, J.J.2
  • 17
    • 0031506199 scopus 로고    scopus 로고
    • Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
    • Chand S., Traub R., Uzsoy R. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research. 70:1997;115-125
    • (1997) Annals of Operations Research , vol.70 , pp. 115-125
    • Chand, S.1    Traub, R.2    Uzsoy, R.3
  • 18
    • 0042622980 scopus 로고    scopus 로고
    • A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
    • Mason S.J., Fowler J.W., Carlyle W.M. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling. 5(3):2002;247-262
    • (2002) Journal of Scheduling , vol.5 , Issue.3 , pp. 247-262
    • Mason, S.J.1    Fowler, J.W.2    Carlyle, W.M.3
  • 19
    • 0034229139 scopus 로고    scopus 로고
    • Recent development in evolutionary computation for manufacturing optimization: Problems, solutions and comparisons
    • Dimipoulos C., Zalzala A.M.S. Recent development in evolutionary computation for manufacturing optimization. problems, solutions and comparisons IEEE Transactions on Evolutionary Computation. 4(2):2000;93-113
    • (2000) IEEE Transactions on Evolutionary Computation , vol.4 , Issue.2 , pp. 93-113
    • Dimipoulos, C.1    Zalzala, A.M.S.2
  • 20
    • 0242653680 scopus 로고    scopus 로고
    • Use of genetic algorithms to solve production and operations management problems: A review
    • Aytug H., Khouja M., Vergara F.E. Use of genetic algorithms to solve production and operations management problems. a review International Journal of Production Research. 41(17):2003;3955-4009
    • (2003) International Journal of Production Research , vol.41 , Issue.17 , pp. 3955-4009
    • Aytug, H.1    Khouja, M.2    Vergara, F.E.3
  • 21
    • 18744405670 scopus 로고    scopus 로고
    • Scheduling jobs in an alcan aluminium foundry using a genetic algorithm
    • Gravel M., Price W.L., Gagne C. Scheduling jobs in an alcan aluminium foundry using a genetic algorithm. International Journal of Production Research. 38(13):2000;3031-3041
    • (2000) International Journal of Production Research , vol.38 , Issue.13 , pp. 3031-3041
    • Gravel, M.1    Price, W.L.2    Gagne, C.3
  • 22
    • 0344255622 scopus 로고    scopus 로고
    • A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups
    • Fowler J.W., Horng S., Cochran J.K. A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups. International Journal of Industrial Engineering. 10(3):2003;232-243
    • (2003) International Journal of Industrial Engineering , vol.10 , Issue.3 , pp. 232-243
    • Fowler, J.W.1    Horng, S.2    Cochran, J.K.3
  • 23
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen A.P.J., Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science. 33(8):1987;1035-1047
    • (1987) Management Science , vol.33 , Issue.8 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, T.E.2
  • 24
    • 0029404198 scopus 로고
    • Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times
    • Ovacik I.M., Uzsoy R. Rolling horizon procedures for dynamic parallel machine scheduling with sequence dependent setup times. International Journal of Production Research. 33:1995;3173-3292
    • (1995) International Journal of Production Research , vol.33 , pp. 3173-3292
    • Ovacik, I.M.1    Uzsoy, R.2
  • 25
    • 0003780914 scopus 로고
    • Guided forward search in tardiness scheduling of large one machine problems
    • D.E. Brown, & W.T. Scherer. Hingham, MA: Kluwer Academic Publishers
    • Morton T.E., Ramnath P. Guided forward search in tardiness scheduling of large one machine problems. Brown D.E., Scherer W.T. Intelligent scheduling systems. 1995;Kluwer Academic Publishers, Hingham, MA
    • (1995) Intelligent Scheduling Systems
    • Morton, T.E.1    Ramnath, P.2
  • 26
    • 0035546629 scopus 로고    scopus 로고
    • A new dominance rule to minimize total weighted tardiness with unequal release dates
    • Akturk M.S., Ozdemir D. A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research. 135:2001;394-412
    • (2001) European Journal of Operational Research , vol.135 , pp. 394-412
    • Akturk, M.S.1    Ozdemir, D.2
  • 27
    • 84987049348 scopus 로고
    • A decision theory approach to priority dispatching for job shop scheduling
    • Kanet J.J., Zhou Z. A decision theory approach to priority dispatching for job shop scheduling. Production and Operations Management. 2(1):1993;2-13
    • (1993) Production and Operations Management , vol.2 , Issue.1 , pp. 2-13
    • Kanet, J.J.1    Zhou, Z.2
  • 30
    • 13844268335 scopus 로고    scopus 로고
    • On the structure of optimal schedules for minimizing total weighted tardiness on parallel batch-processing machines
    • Portland, Oregon
    • Kurz ME. On the structure of optimal schedules for minimizing total weighted tardiness on parallel batch-processing machines. Proceedings of the 10th Industrial Engineering Research Conference, Portland, Oregon; 2003.
    • (2003) Proceedings of the 10th Industrial Engineering Research Conference
    • Kurz, M.E.1


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