메뉴 건너뛰기




Volumn 55, Issue 9-12, 2011, Pages 1135-1147

A nondominated ranked genetic algorithm for bi-objective single machine preemptive scheduling in just-in-time environment

Author keywords

Earliness; Nondominated ranked genetic algorithm; Number of tardy jobs; Preemption; Scheduling; Single machine

Indexed keywords

EARLINESS; NONDOMINATED RANKED GENETIC ALGORITHM; NUMBER OF TARDY JOBS; PREEMPTION; SINGLE MACHINES;

EID: 79961026818     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3126-0     Document Type: Article
Times cited : (10)

References (37)
  • 1
    • 56249099657 scopus 로고    scopus 로고
    • The one-machine just-in-time scheduling problem with preemption
    • 1159.90020 10.1016/j.disopt.2008.08.001
    • Y Hendel N Runge F Sourd 2009 The one-machine just-in-time scheduling problem with preemption Discrete Optim 6 10 22 1159.90020 10.1016/j.disopt.2008. 08.001
    • (2009) Discrete Optim , vol.6 , pp. 10-22
    • Hendel, Y.1    Runge, N.2    Sourd, F.3
  • 2
    • 67349211166 scopus 로고    scopus 로고
    • Effective implementation of the ε-constraint method in multi-objective mathematical programming problems
    • 1168.65029 10.1016/j.amc.2009.03.037
    • G Mavrotas 2009 Effective implementation of the ε-constraint method in multi-objective mathematical programming problems Appl Math Comput 213 455 465 1168.65029 10.1016/j.amc.2009.03.037
    • (2009) Appl Math Comput , vol.213 , pp. 455-465
    • Mavrotas, G.1
  • 3
    • 54049149435 scopus 로고    scopus 로고
    • An exact ε-constraint method for bi-objective combinatorial optimization problems
    • 1179.90274 10.1016/j.ejor.2007.12.014
    • JF Bérubé M Gendreau JY Potvin 2009 An exact ε-constraint method for bi-objective combinatorial optimization problems Eur J Oper Res 194 39 50 1179.90274 10.1016/j.ejor.2007.12.014
    • (2009) Eur J Oper Res , vol.194 , pp. 39-50
    • Bérubé, J.F.1    Gendreau, M.2    Potvin, J.Y.3
  • 4
    • 34848912819 scopus 로고    scopus 로고
    • Preemption in single machine earliness/tardiness scheduling
    • DOI 10.1007/s10951-007-0028-6
    • K Bülbül P Kaminsky C Yano 2007 Preemption in single machine earliness/tardiness scheduling J Sched 10 271 292 1168.90427 10.1007/s10951-007-0028-6 (Pubitemid 47501050)
    • (2007) Journal of Scheduling , vol.10 , Issue.4-5 , pp. 271-292
    • Bulbul, K.1    Kaminsky, P.2    Yano, C.3
  • 5
    • 0037290972 scopus 로고    scopus 로고
    • Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches
    • 10.1016/S0360-8352(02)00181-X
    • M Feldmann D Biskup 2003 Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches Comput Ind Eng 44 2 307 323 10.1016/S0360-8352(02)00181-X
    • (2003) Comput Ind Eng , vol.44 , Issue.2 , pp. 307-323
    • Feldmann, M.1    Biskup, D.2
  • 6
    • 13544272574 scopus 로고    scopus 로고
    • Punctuality and idleness in just-in-time scheduling
    • DOI 10.1016/j.ejor.2004.07.018, PII S0377221704004758, Multicriteria Scheduling
    • F Sourd 2005 Punctuality and idleness in just-in-time scheduling Eur J Oper Res 167 739 751 1077.90031 10.1016/j.ejor.2004.07.018 (Pubitemid 40220088)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 739-751
    • Sourd, F.1
  • 7
    • 67649961766 scopus 로고    scopus 로고
    • New exact algorithms for one-machine earliness-tardiness scheduling
    • 10.1287/ijoc.1080.0287
    • F Sourd 2009 New exact algorithms for one-machine earliness-tardiness scheduling INFORMS J Comput 21 1 167 175 10.1287/ijoc.1080.0287
    • (2009) INFORMS J Comput , vol.21 , Issue.1 , pp. 167-175
    • Sourd, F.1
  • 8
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • 0699.90052 10.1287/opre.38.1.22
    • KR Baker GD Scudder 1990 Sequencing with earliness and tardiness penalties: a review Oper Res 38 22 36 0699.90052 10.1287/opre.38.1.22
    • (1990) Oper Res , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 9
    • 0030262170 scopus 로고    scopus 로고
    • A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
    • DOI 10.1016/0377-2217(96)00133-6, PII S0377221796001336
    • V Sridharan Z Zhou 1996 A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems Eur J Oper Res 94 292 301 0953.90526 10.1016/0377-2217(96)00133-6 (Pubitemid 126385637)
    • (1996) European Journal of Operational Research , vol.94 , Issue.2 , pp. 292-301
    • Sridharan, V.1    Zhou, Z.2
  • 10
    • 0035192727 scopus 로고    scopus 로고
    • Heuristic for single machine scheduling with early and tardy costs
    • DOI 10.1016/S0377-2217(99)00345-8
    • R Mazzini VA Armentano 2001 A heuristic for single machine scheduling with early and tardy costs Eur J Oper Res 128 129 146 0983.90021 10.1016/S0377-2217(99)00345-8 (Pubitemid 32022966)
    • (2001) European Journal of Operational Research , vol.128 , Issue.1 , pp. 129-146
    • Mazzini, R.1    Armentano, V.A.2
  • 11
    • 0037120685 scopus 로고    scopus 로고
    • Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
    • DOI 10.1016/S0377-2217(01)00302-2, PII S0377221701003022
    • G Wan BPC Yen 2002 Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties Eur J Oper Res 142 271 281 1082.90531 10.1016/S0377-2217(01)00302-2 (Pubitemid 34803133)
    • (2002) European Journal of Operational Research , vol.142 , Issue.2 , pp. 271-281
    • Wan, G.1    Yen, B.P.-C.2
  • 12
    • 3943054030 scopus 로고    scopus 로고
    • Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
    • 1067.90043 10.1016/j.ejor.2004.03.006
    • CM Hino DP Ronconi AB Mendes 2005 Minimizing earliness and tardiness penalties in a single-machine problem with a common due date Eur J Oper Res 160 190 201 1067.90043 10.1016/j.ejor.2004.03.006
    • (2005) Eur J Oper Res , vol.160 , pp. 190-201
    • Hino, C.M.1    Ronconi, D.P.2    Mendes, A.B.3
  • 13
    • 0038789163 scopus 로고    scopus 로고
    • Single machine scheduling with maximum earliness and number tardy
    • 10.1016/S0360-8352(03)00034-2
    • M Azizoglu S Kondakci M Köksalan 2003 Single machine scheduling with maximum earliness and number tardy Comput Ind Eng 45 257 268 10.1016/S0360-8352(03)00034-2
    • (2003) Comput Ind Eng , vol.45 , pp. 257-268
    • Azizoglu, M.1    Kondakci, S.2    Köksalan, M.3
  • 15
    • 24344434513 scopus 로고    scopus 로고
    • Multiobjective combinatorial optimization-theory, methodology, and applications
    • 10.1007/0-306-48107-3-8
    • M Ehrgott X Gandibleux 2002 Multiobjective combinatorial optimization-theory, methodology, and applications Int Ser Oper Res Manage Sci 52 369 444 10.1007/0-306-48107-3-8
    • (2002) Int ser Oper Res Manage Sci , vol.52 , pp. 369-444
    • Ehrgott, M.1    Gandibleux, X.2
  • 18
    • 0028585530 scopus 로고
    • A niched Pareto genetic algorithm for multi-objective optimisation. Proceedings of the 1st IEEEICEC conference on evolutionary computation, IEEE World Congress
    • J Horn N Nafpliotis DE Goldberg 1994 A niched Pareto genetic algorithm for multi-objective optimisation. Proceedings of the 1st IEEEICEC conference on evolutionary computation, IEEE World Congress Comput Intell 1 82 87
    • (1994) Comput Intell , vol.1 , pp. 82-87
    • Horn, J.1    Nafpliotis, N.2    Goldberg, D.E.3
  • 19
    • 0000852513 scopus 로고
    • Multiobjective function optimization using non-dominated sorting genetic algorithms
    • 10.1162/evco.1994.2.3.221
    • N Srinivas K Deb 1995 Multiobjective function optimization using non-dominated sorting genetic algorithms Evol Comput 2 3 221 248 10.1162/evco.1994.2.3.221
    • (1995) Evol Comput , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 20
    • 0001953837 scopus 로고
    • Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization
    • S. Forrest (eds). Morgan Kaufman Publishers, University of Illinois at Urbana-Champaign San Mateo, CA
    • Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Forrest S (ed) Proceedings of the fifth international conference on genetic algorithms. Morgan Kaufman Publishers, University of Illinois at Urbana-Champaign, San Mateo, CA, pp 416-423
    • (1993) Proceedings of the Fifth International Conference on Genetic Algorithms , pp. 416-423
    • Fonseca, C.M.1    Fleming, P.J.2
  • 25
    • 67650348149 scopus 로고    scopus 로고
    • Parametric study to enhance genetic algorithm performance, using ranked based roulette wheel selection method
    • O Al Jadaan CR Rao L Rajamani 2006 Parametric study to enhance genetic algorithm performance, using ranked based roulette wheel selection method Merida Spain 2 274 278
    • (2006) Merida Spain , vol.2 , pp. 274-278
    • Al Jadaan, O.1    Rao, C.R.2    Rajamani, L.3
  • 28
    • 12344285964 scopus 로고    scopus 로고
    • Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
    • DOI 10.1016/j.ejor.2004.01.022, PII S0377221704000529
    • R Ruiz C Maroto J Alcaraz 2005 Solving the flowshop scheduling problem with sequence dependent setup times using advanced meta heuristics Eur J Oper Res 165 1 34 54 1112.90338 10.1016/j.ejor.2004.01.022 (Pubitemid 40135592)
    • (2005) European Journal of Operational Research , vol.165 , Issue.1 , pp. 34-54
    • Ruiz, R.1    Maroto, C.2    Alcaraz, J.3
  • 30
    • 36049016444 scopus 로고    scopus 로고
    • Improved immune algorithm for global numerical optimization and job-shop scheduling problems
    • DOI 10.1016/j.amc.2007.04.038, PII S0096300307004821
    • JT Tsai, et al. 2007 Improved immune algorithm for global numerical optimization and job-shop scheduling problems Appl Math Comput 194 2 406 424 1193.90114 10.1016/j.amc.2007.04.038 (Pubitemid 350088981)
    • (2007) Applied Mathematics and Computation , vol.194 , Issue.2 , pp. 406-424
    • Tsai, J.-T.1    Ho, W.-H.2    Liu, T.-K.3    Chou, J.-H.4
  • 31
    • 33244484571 scopus 로고    scopus 로고
    • Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs
    • DOI 10.1016/j.simpat.2005.05.001, PII S1569190X05000687
    • R Al-Aomar 2006 Incorporating robustness into genetic algorithm search of stochastic simulation outputs Simul Model Pract Theory 14 201 223 10.1016/j.simpat.2005.05.001 (Pubitemid 43277668)
    • (2006) Simulation Modelling Practice and Theory , vol.14 , Issue.3 , pp. 201-223
    • Al-Aomar, R.1
  • 33
    • 0032120699 scopus 로고    scopus 로고
    • A genetic algorithm for multiple objective sequencing problems in mixed- model assembly lines
    • 1042.90553 10.1016/S0305-0548(98)00026-4
    • CJ Hyun Y Kim YK Kim 1998 A genetic algorithm for multiple objective sequencing problems in mixed- model assembly lines Comput Oper Res 25 7-8 675 690 1042.90553 10.1016/S0305-0548(98)00026-4
    • (1998) Comput Oper Res , vol.25 , Issue.78 , pp. 675-690
    • Hyun, C.J.1    Kim, Y.2    Kim, Y.K.3
  • 34
    • 13544275547 scopus 로고    scopus 로고
    • A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines
    • DOI 10.1016/j.ejor.2004.07.016, PII S0377221704004734, Multicriteria Scheduling
    • SA Mansouri 2005 A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines Eur J Oper Res 167 3 696 716 1077.90027 10.1016/j.ejor.2004.07.016 (Pubitemid 40220086)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 696-716
    • Mansouri, S.A.1
  • 36
    • 0027912254 scopus 로고
    • Complexity of single machine, multi-criteria scheduling problems
    • DOI 10.1016/0377-2217(93)90236-G
    • CL Chen RL Bulfin 1993 Complexity of single machine multicriteria scheduling problems Eur J Oper Res 70 115 125 0795.90032 10.1016/0377-2217(93) 90236-G (Pubitemid 23707630)
    • (1993) European Journal of Operational Research , vol.70 , Issue.1 , pp. 115-125
    • Chen Chuen-Lung1    Bulfin Robert, L.2
  • 37
    • 0032115055 scopus 로고    scopus 로고
    • One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs
    • PII S0925527398000620
    • E Guner S Erol K Tani 1998 One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs Int J Prod Econ 55 213 219 10.1016/S0925-5273(98)00062-0 (Pubitemid 128401612)
    • (1998) International Journal of Production Economics , vol.55 , Issue.2 , pp. 213-219
    • Guner, E.1    Erol, S.2    Tani, K.3


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