메뉴 건너뛰기




Volumn 62, Issue 1, 2012, Pages 29-38

A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Author keywords

Batched delivery system; Genetic algorithm; Scheduling; Single machine; Weighted tardiness earliness

Indexed keywords

DELIVERY COSTS; DELIVERY SYSTEMS; HOLDING COSTS; INVENTORY COSTS; MATHEMATICAL MODELING; POSITIVE EFFECTS; SINGLE-MACHINE; SINGLE-MACHINE SCHEDULING; TOTAL COSTS; TOTAL TARDINESS; WEIGHTED TARDINESS;

EID: 82755189383     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.08.014     Document Type: Article
Times cited : (56)

References (30)
  • 1
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • K.R. Baker, and G.D. Scudder Sequencing with earliness and tardiness penalties: A review Operations Research 38 1990 22 36
    • (1990) Operations Research , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 2
    • 0001096735 scopus 로고
    • Genetics and random keys for sequencing and optimization
    • J.C. Bean Genetics and random keys for sequencing and optimization ORSA Journal on Computing 6 1994 154 160
    • (1994) ORSA Journal on Computing , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 3
    • 0029371267 scopus 로고
    • Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
    • R. Cheng, M. Gen, and T. Tozawa Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms Computers & Industrial Engineering 29 1995 513 517
    • (1995) Computers & Industrial Engineering , vol.29 , pp. 513-517
    • Cheng, R.1    Gen, M.2    Tozawa, T.3
  • 5
    • 0037290972 scopus 로고    scopus 로고
    • Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches
    • M. Feldmann, and D. Biskup Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches Computers & Industrial Engineering 44 2003 307 323
    • (2003) Computers & Industrial Engineering , vol.44 , pp. 307-323
    • Feldmann, M.1    Biskup, D.2
  • 6
    • 0024010206 scopus 로고
    • One-processor scheduling with symmetric earliness and tardiness penalties
    • M.R. Garey, R.E. Tarjan, and G.T. Wilfong One-processor scheduling with symmetric earliness and tardiness penalties Mathematics of Operations Research 13 1988 330 348
    • (1988) Mathematics of Operations Research , vol.13 , pp. 330-348
    • Garey, M.R.1    Tarjan, R.E.2    Wilfong, G.T.3
  • 7
    • 0003722376 scopus 로고
    • Optimization and machine learning Addison-Wesley New York
    • D.E. Goldberg Genetic algorithms in search Optimization and machine learning 1989 Addison-Wesley New York
    • (1989) Genetic Algorithms in Search
    • Goldberg, D.E.1
  • 9
    • 0020809540 scopus 로고
    • Minimizing a quadratic function of job lateness on a single machine
    • DOI 10.1016/0167-188X(83)90012-5
    • S.K. Gupta, and T. Sen Minimizing a quadratic function of job lateness on a single machine Engineering Costs and Production Economics 7 1983 187 194 (Pubitemid 14469582)
    • (1983) Engineering costs and production economics , vol.7 , Issue.3 , pp. 187-194
    • Gupta Sushil, K.1    Sen Tapan2
  • 10
    • 0026223827 scopus 로고
    • Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
    • N.G. Hall, G.W. Kubiak, and S.P. Sethi Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date Operations Research 39 1991 847 856
    • (1991) Operations Research , vol.39 , pp. 847-856
    • Hall, N.G.1    Kubiak, G.W.2    Sethi, S.P.3
  • 11
    • 2342539189 scopus 로고    scopus 로고
    • Supply chain scheduling: Batching and delivery
    • N.G. Hall, and C.N. Potts Supply chain scheduling: Batching and delivery Operations Research 51 2003 566 584
    • (2003) Operations Research , vol.51 , pp. 566-584
    • Hall, N.G.1    Potts, C.N.2
  • 12
    • 33847618314 scopus 로고    scopus 로고
    • Minimizing total earliness and tardiness on a single machine using hybrid heuristic
    • R.M. Hallah Minimizing total earliness and tardiness on a single machine using hybrid heuristic Computers and Operations Research 34 2007 3126 3142
    • (2007) Computers and Operations Research , vol.34 , pp. 3126-3142
    • Hallah, R.M.1
  • 13
    • 36049034643 scopus 로고    scopus 로고
    • Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
    • DOI 10.1016/j.amc.2007.04.063, PII S0096300307005103
    • F. Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan, and M. YazdanParas Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs Applied Mathematics and Computation 194 2007 552 560 (Pubitemid 350088998)
    • (2007) Applied Mathematics and Computation , vol.194 , Issue.2 , pp. 552-560
    • Jolai, F.1    Rabbani, M.2    Amalnick, S.3    Dabaghi, A.4    Dehghan, M.5    Parast, M.Y.6
  • 14
    • 0028734441 scopus 로고
    • Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
    • Y.D. Kim, and C.A. Yano Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates Naval Research Logistics 41 1994 913 933
    • (1994) Naval Research Logistics , vol.41 , pp. 913-933
    • Kim, Y.D.1    Yano, C.A.2
  • 15
    • 0037448810 scopus 로고    scopus 로고
    • Using genetic algorithms for single-machine bicriteria scheduling problems
    • DOI 10.1016/S0377-2217(02)00220-5, PII S0377221702002205
    • M. Koksalan, and A. BurakKeha Using genetic algorithms for single machine bi-criteria scheduling problems European Journal of Operations Research 145 2003 543 556 (Pubitemid 35411805)
    • (2003) European Journal of Operational Research , vol.145 , Issue.3 , pp. 543-556
    • Koksalan, M.1    Keha, A.B.2
  • 16
    • 34249057143 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
    • DOI 10.1016/j.ejor.2006.09.087, PII S0377221706010034
    • M. MahdaviMazdeh, M. Sarhadi, and K.S. Hindi A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs European Journal of Operational Research 183 2007 74 86 (Pubitemid 46803125)
    • (2007) European Journal of Operational Research , vol.183 , Issue.1 , pp. 74-86
    • Mazdeh, M.M.1    Sarhadi, M.2    Hindi, K.S.3
  • 17
    • 35248888931 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
    • DOI 10.1016/j.cor.2006.07.006, PII S0305054806001523
    • M. MahdaviMazdeh, M. Sarhadi, and K.S. Hindi A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times Computers & Operations Research 35 2008 1099 1111 (Pubitemid 47566330)
    • (2008) Computers and Operations Research , vol.35 , Issue.4 , pp. 1099-1111
    • Mahdavi Mazdeh, M.1    Sarhadi, M.2    Hindi, K.S.3
  • 18
    • 84989754383 scopus 로고
    • Minimizing flow time on a single-machine with job classes and setup times
    • A.J. Mason, and E.J. Anderson Minimizing flow time on a single-machine with job classes and setup times Naval Research Logistics 38 1991 333 350
    • (1991) Naval Research Logistics , vol.38 , pp. 333-350
    • Mason, A.J.1    Anderson, E.J.2
  • 20
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • DOI 10.1016/S0377-2217(99)00153-8
    • C.N. Potts, and M.Y. Kovalyov Scheduling with batching: A review European Journal of Operational Research 120 2000 228 249 (Pubitemid 30542656)
    • (2000) European Journal of Operational Research , vol.120 , Issue.2 , pp. 228-249
    • Potts, C.N.1    Kovalyov, M.Y.2
  • 21
    • 0037121183 scopus 로고    scopus 로고
    • Minimizing the sum of squares lateness on a single machine
    • J. Schaller Minimizing the sum of squares lateness on a single machine European Journal of Operational Research 143 2002 64 79
    • (2002) European Journal of Operational Research , vol.143 , pp. 64-79
    • Schaller, J.1
  • 22
    • 33846116652 scopus 로고    scopus 로고
    • A comparison of lower bounds for the single-machine early/tardy problem
    • DOI 10.1016/j.cor.2005.09.003, PII S0305054805002935
    • J. Schaller A comparison of lower bounds for the single-machine early/tardy problem Computers & Operations Research 34 2007 2279 2292 (Pubitemid 46073422)
    • (2007) Computers and Operations Research , vol.34 , Issue.8 , pp. 2279-2292
    • Schaller, J.1
  • 23
    • 0030125484 scopus 로고
    • Minimizing a weighted quadratic function of job lateness in the single machine system
    • T. Sen, P. Dileepan, and M.R. Lind Minimizing a weighted quadratic function of job lateness in the single machine system International Journal of Production Economics 42 1995 237 243
    • (1995) International Journal of Production Economics , vol.42 , pp. 237-243
    • Sen, T.1    Dileepan, P.2    Lind, M.R.3
  • 24
    • 0032114993 scopus 로고    scopus 로고
    • A heuristic to minimize a quadratic function of job lateness on a single machine
    • L.H. Su, and P.C. Chang A heuristic to minimize a quadratic function of job lateness on a single machine International Journal of Production Economics 55 1998 169 175
    • (1998) International Journal of Production Economics , vol.55 , pp. 169-175
    • Su, L.H.1    Chang, P.C.2
  • 25
    • 77949653622 scopus 로고    scopus 로고
    • Lot-sizing and scheduling problem with earliness-tardiness and setup penalties
    • W. Supithak, S.D. Liman, and E.J. Montes Lot-sizing and scheduling problem with earliness-tardiness and setup penalties Computers & Industrial Engineering 58 2010 363 372
    • (2010) Computers & Industrial Engineering , vol.58 , pp. 363-372
    • Supithak, W.1    Liman, S.D.2    Montes, E.J.3
  • 26
    • 6344228467 scopus 로고    scopus 로고
    • Earliness/tardiness scheduling with a common due date and family setups
    • R.H. Suriyaarachchi, and A. Wirth Earliness/tardiness scheduling with a common due date and family setups Computers & Industrial Engineering 47 2004 275 288
    • (2004) Computers & Industrial Engineering , vol.47 , pp. 275-288
    • Suriyaarachchi, R.H.1    Wirth, A.2
  • 27
    • 82755161235 scopus 로고
    • Proc. 3rd Int'l conference on genetic algorithms Morgan Kaufmann Publishing Massachusetts
    • G. Syswerda Uniform crossover in genetic algorithms Proc. 3rd Int'l conference on genetic algorithms 1989 Morgan Kaufmann Publishing Massachusetts
    • (1989) Uniform Crossover in Genetic Algorithms
    • Syswerda, G.1
  • 28
    • 62549103757 scopus 로고    scopus 로고
    • A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
    • J.M.S. Valente, and J.F. Gonalves A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties Computers & Operations Research 36 2009 2707 2715
    • (2009) Computers & Operations Research , vol.36 , pp. 2707-2715
    • Valente, J.M.S.1    Gonalves, J.F.2
  • 29
    • 74849094249 scopus 로고    scopus 로고
    • Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm
    • K.C. Ying Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm Computers & Industrial Engineering 55 2008 494 502
    • (2008) Computers & Industrial Engineering , vol.55 , pp. 494-502
    • Ying, K.C.1


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