메뉴 건너뛰기




Volumn 33, Issue 1, 2009, Pages 579-596

A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties

Author keywords

Dominance properties; Earliness tardiness; Genetic algorithm; Optimal schedule; Single machine scheduling

Indexed keywords

BOOLEAN FUNCTIONS; GENETIC ALGORITHMS; MACHINERY; SCHEDULING; TRAJECTORIES;

EID: 51749114425     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2008.01.006     Document Type: Article
Times cited : (25)

References (28)
  • 1
    • 0000245614 scopus 로고
    • The single machine early/tardy problem
    • Ow P.S., and Morton E.T. The single machine early/tardy problem. Manage. Sci. 35 (1989) 171-191
    • (1989) Manage. Sci. , vol.35 , pp. 171-191
    • Ow, P.S.1    Morton, E.T.2
  • 2
    • 0026243299 scopus 로고
    • Bicriteria scheduling problem involving total tardiness and total earliness penalties
    • Azizoglu M., Kondakci SM., and Kirca O. Bicriteria scheduling problem involving total tardiness and total earliness penalties. Int. J. Prod. Econom. 23 1-3 (1991) 17-24
    • (1991) Int. J. Prod. Econom. , vol.23 , Issue.1-3 , pp. 17-24
    • Azizoglu, M.1    Kondakci, SM.2    Kirca, O.3
  • 3
    • 0027224847 scopus 로고
    • One machine heuristic with efficiency and stability as criteria
    • Wu S.D., Storer R.H., and Chang P.C. One machine heuristic with efficiency and stability as criteria. Comput. Operat. Res. 20 (1993)
    • (1993) Comput. Operat. Res. , vol.20
    • Wu, S.D.1    Storer, R.H.2    Chang, P.C.3
  • 4
    • 0032114993 scopus 로고
    • A heuristic to minimize a quadratic function of job lateness on a single machine
    • Su L.H., and Chang P.C. A heuristic to minimize a quadratic function of job lateness on a single machine. Int. J. Prod. Econom. 55 (1988) 169-175
    • (1988) Int. J. Prod. Econom. , vol.55 , pp. 169-175
    • Su, L.H.1    Chang, P.C.2
  • 5
    • 0035447093 scopus 로고    scopus 로고
    • Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs
    • Su L.H., and Chang P.C. Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs. Comput. Ind. Eng. 40 (2001) 349-360
    • (2001) Comput. Ind. Eng. , vol.40 , pp. 349-360
    • Su, L.H.1    Chang, P.C.2
  • 7
    • 0002672225 scopus 로고
    • A greedy heuristic for bi-criterion single machine scheduling problems
    • Chang P.C., and Lee H.C. A greedy heuristic for bi-criterion single machine scheduling problems. Comput. Ind. Eng. 22 2 (1992) 121-131
    • (1992) Comput. Ind. Eng. , vol.22 , Issue.2 , pp. 121-131
    • Chang, P.C.1    Lee, H.C.2
  • 8
    • 0009460332 scopus 로고
    • A two phase approach for single machine scheduling: minimizing the total absolute deviation
    • Chang P.C., and Lee H.C. A two phase approach for single machine scheduling: minimizing the total absolute deviation. J. Chin. Inst. Eng. 15 6 (1992) 735-742
    • (1992) J. Chin. Inst. Eng. , vol.15 , Issue.6 , pp. 735-742
    • Chang, P.C.1    Lee, H.C.2
  • 9
    • 0033130807 scopus 로고    scopus 로고
    • A branch and bound approach for single machine scheduling with earliness and tardiness penalties
    • Chang P.C. A branch and bound approach for single machine scheduling with earliness and tardiness penalties. Comput. Math. Appl. 37 (1999) 133-144
    • (1999) Comput. Math. Appl. , vol.37 , pp. 133-144
    • Chang, P.C.1
  • 10
    • 38249011510 scopus 로고
    • Scheduling with release dates on a single machine to minimize total weighted completion time
    • Belouadah H., Posner M.E., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discret. Appl. Math. 36 (1992) 213-231
    • (1992) Discret. Appl. Math. , vol.36 , pp. 213-231
    • Belouadah, H.1    Posner, M.E.2    Potts, C.N.3
  • 11
    • 0019342692 scopus 로고
    • Scheduling with release dates on a single machine to minimize total weighted completion time
    • Hariri A.M.A., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discret. Appl. Math. 36 (1983) 99-109
    • (1983) Discret. Appl. Math. , vol.36 , pp. 99-109
    • Hariri, A.M.A.1    Potts, C.N.2
  • 12
    • 0028734441 scopus 로고
    • Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
    • Kim Y.D., and Yano C.A. Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Res. Logist. 41 (1994) 913-933
    • (1994) Naval Res. Logist. , vol.41 , pp. 913-933
    • Kim, Y.D.1    Yano, C.A.2
  • 13
    • 51749083215 scopus 로고    scopus 로고
    • J.M.S. Valente, R.A.F.S. Alves, Heuristics for the early/tardy scheduling problem with release dates, Working Paper 129, Faculdade de Economia do Porto, Portugal, 2003.
    • J.M.S. Valente, R.A.F.S. Alves, Heuristics for the early/tardy scheduling problem with release dates, Working Paper 129, Faculdade de Economia do Porto, Portugal, 2003.
  • 14
    • 51749095882 scopus 로고    scopus 로고
    • J.M.S. Valente, R.A.F.S. Alves, Improved heuristics for the early/tardy scheduling problem with no idle time, Working Paper 126, Faculdade de Economia do Porto, Portugal, 2003.
    • J.M.S. Valente, R.A.F.S. Alves, Improved heuristics for the early/tardy scheduling problem with no idle time, Working Paper 126, Faculdade de Economia do Porto, Portugal, 2003.
  • 15
    • 0023965120 scopus 로고
    • Dynamic programming state-space relaxation for single machine scheduling
    • Abdul-Razaq T., and Potts C.N. Dynamic programming state-space relaxation for single machine scheduling. J. Operat. Res. Soc. 39 (1988) 141-152
    • (1988) J. Operat. Res. Soc. , vol.39 , pp. 141-152
    • Abdul-Razaq, T.1    Potts, C.N.2
  • 16
    • 0031076201 scopus 로고    scopus 로고
    • Single machine earliness and tardiness scheduling
    • Li G. Single machine earliness and tardiness scheduling. Eur. J. Operat. Res. 96 (1997) 46-558
    • (1997) Eur. J. Operat. Res. , vol.96 , pp. 46-558
    • Li, G.1
  • 17
    • 0033165933 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
    • Liaw C.-F. A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput. Operat. Res. 26 (1999) 679-693
    • (1999) Comput. Operat. Res. , vol.26 , pp. 679-693
    • Liaw, C.-F.1
  • 18
    • 0023844415 scopus 로고
    • Filtered beam searches in scheduling
    • Ow P.S., and Morton T.E. Filtered beam searches in scheduling. Int. J. Prod. Res. 26 (1988) 35-62
    • (1988) Int. J. Prod. Res. , vol.26 , pp. 35-62
    • Ow, P.S.1    Morton, T.E.2
  • 23
    • 15944395695 scopus 로고    scopus 로고
    • Genetic algorithms applied in BOPP film scheduling problems
    • Chang P.C., Hsieh J.C., and Wang Y.W. Genetic algorithms applied in BOPP film scheduling problems. Appl. Soft Comput. 3 (2003) 139-148
    • (2003) Appl. Soft Comput. , vol.3 , pp. 139-148
    • Chang, P.C.1    Hsieh, J.C.2    Wang, Y.W.3
  • 24
    • 24144460572 scopus 로고    scopus 로고
    • Two phase sub-population genetic algorithm for parallel machine scheduling problem
    • Chang P.C., Chen S.H., and Lin K.L. Two phase sub-population genetic algorithm for parallel machine scheduling problem. Expert Syst. Appl. 29 3 (2005) 705-712
    • (2005) Expert Syst. Appl. , vol.29 , Issue.3 , pp. 705-712
    • Chang, P.C.1    Chen, S.H.2    Lin, K.L.3
  • 25
    • 33745846840 scopus 로고    scopus 로고
    • A case-injected genetic algorithm for single machine scheduling problems with release time
    • Chang P.C., Hsieh J.C., and Liu C.H. A case-injected genetic algorithm for single machine scheduling problems with release time. Int. J. Prod. Econom. 103 2 (2006) 551-564
    • (2006) Int. J. Prod. Econom. , vol.103 , Issue.2 , pp. 551-564
    • Chang, P.C.1    Hsieh, J.C.2    Liu, C.H.3
  • 26
    • 0030242695 scopus 로고    scopus 로고
    • A tutorial survey of job shop scheduling problems using genetic algorithms - I: Representation
    • Chang R., Gen M., and Tsujimura T. A tutorial survey of job shop scheduling problems using genetic algorithms - I: Representation. Comput. Ind. Eng. 30 (1996) 983-987
    • (1996) Comput. Ind. Eng. , vol.30 , pp. 983-987
    • Chang, R.1    Gen, M.2    Tsujimura, T.3
  • 27
    • 3543096874 scopus 로고    scopus 로고
    • The one machine problem with earliness and tardiness penalties
    • Sourd F., and Sidhoum S.K. The one machine problem with earliness and tardiness penalties. J. Sched. 6 (2003) 533-549
    • (2003) J. Sched. , vol.6 , pp. 533-549
    • Sourd, F.1    Sidhoum, S.K.2
  • 28
    • 51749122172 scopus 로고    scopus 로고
    • F. Sourd, S.K. Sidhoum, An efficient algorithm for the earliness tardiness, 2005, .
    • F. Sourd, S.K. Sidhoum, An efficient algorithm for the earliness tardiness, 2005, .


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