메뉴 건너뛰기




Volumn 224, Issue 7, 2010, Pages 1119-1131

Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection

Author keywords

colonial competitive algorithm; Pareto set; Pareto simulated annealing; performance measure; rejection cost; scheduling

Indexed keywords

HEURISTIC ALGORITHMS; JOB SHOP SCHEDULING; PARETO PRINCIPLE; SCHEDULING; SIMULATED ANNEALING;

EID: 83555175583     PISSN: 09544054     EISSN: 20412975     Source Type: Journal    
DOI: 10.1243/09544054JEM1746     Document Type: Article
Times cited : (17)

References (33)
  • 1
    • 54049113908 scopus 로고    scopus 로고
    • Scheduling linear deteriorating jobs with rejection on a single machine
    • Cheng Y., Sun S., Scheduling linear deteriorating jobs with rejection on a single machine. Eur. J. Oper. Res. 194 (1) (2009): 18–27. DOI: 10.1016/j.ejor.2007.11.047.
    • (2009) Eur. J. Oper. Res , vol.194 , Issue.1 , pp. 18-27
    • Cheng, Y.1    Sun, S.2
  • 3
    • 35348949481 scopus 로고    scopus 로고
    • Online scheduling with machine cost and rejection
    • Nagy-Gyorgy J., Imreh C., Online scheduling with machine cost and rejection. Discrete Appl. Math. 155 (18) (2007): 2546–2554.
    • (2007) Discrete Appl. Math , vol.155 , Issue.18 , pp. 2546-2554
    • Nagy-Gyorgy, J.1    Imreh, C.2
  • 4
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math., 5 (1979): 287–326.
    • (1979) Ann. Discrete Math , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 5
    • 0002066821 scopus 로고
    • Various optimizers for single stage production
    • Smith W. E., Various optimizers for single stage production. Nav. Res. Logist. 3 (1) (1956): 59–66.
    • (1956) Nav. Res. Logist , vol.3 , Issue.1 , pp. 59-66
    • Smith, W.E.1
  • 8
    • 0036887947 scopus 로고    scopus 로고
    • Online scheduling of unit time jobs with rejection: Minimization the total completion time
    • Epstein L., Noga J., Woeginger G. J., Online scheduling of unit time jobs with rejection: Minimization the total completion time. Oper. Res. Lett. 30 (6) (2002): 415–420.
    • (2002) Oper. Res. Lett , vol.30 , Issue.6 , pp. 415-420
    • Epstein, L.1    Noga, J.2    Woeginger, G.J.3
  • 9
    • 0001498970 scopus 로고    scopus 로고
    • Online randomized multiprocessor scheduling
    • Seiden S. S., Online randomized multiprocessor scheduling. Algorithmica 28 (2) (2000): 173–216.
    • (2000) Algorithmica , vol.28 , Issue.2 , pp. 173-216
    • Seiden, S.S.1
  • 10
    • 0034911863 scopus 로고    scopus 로고
    • Preemptive multiprocessor scheduling with rejection
    • Seiden S. S., Preemptive multiprocessor scheduling with rejection. Theor. Comput. Sci. 262 (1) (2001): 437–458.
    • (2001) Theor. Comput. Sci , vol.262 , Issue.1 , pp. 437-458
    • Seiden, S.S.1
  • 11
    • 0022012946 scopus 로고
    • Amortized efficiency of list update and paging rules
    • Sleator D., Tarjan R., Amortized efficiency of list update and paging rules. Commun. ACM 28 (2) (1985): 202–208.
    • (1985) Commun. ACM , vol.28 , Issue.2 , pp. 202-208
    • Sleator, D.1    Tarjan, R.2
  • 12
    • 13544257742 scopus 로고    scopus 로고
    • Preemptive scheduling with rejection
    • Hoogeveen H., Skutella M., Woeginger G. J., Preemptive scheduling with rejection. Math. Program. 94 (2–3) (2003): 361–374.
    • (2003) Math. Program , vol.94 , Issue.2-3 , pp. 361-374
    • Hoogeveen, H.1    Skutella, M.2    Woeginger, G.J.3
  • 15
    • 27644440807 scopus 로고    scopus 로고
    • Preemptive and non-preemptive online algorithms for scheduling with rejection of two uniform machines
    • Dosa G., He Y., Preemptive and non-preemptive online algorithms for scheduling with rejection of two uniform machines. Computing 76 (1) (2006): 149–164.
    • (2006) Computing , vol.76 , Issue.1 , pp. 149-164
    • Dosa, G.1    He, Y.2
  • 16
    • 33749618169 scopus 로고    scopus 로고
    • Scheduling with machine cost and rejection
    • Dosa G., He Y., Scheduling with machine cost and rejection. J. Combin. Optim. 12 (4) (2006): 337–350.
    • (2006) J. Combin. Optim , vol.12 , Issue.4 , pp. 337-350
    • Dosa, G.1    He, Y.2
  • 17
    • 0042782765 scopus 로고    scopus 로고
    • Online uniform machine scheduling with rejection
    • He Y., Min X., Online uniform machine scheduling with rejection. Computing 65 (1) (2000): 1–12.
    • (2000) Computing , vol.65 , Issue.1 , pp. 1-12
    • He, Y.1    Min, X.2
  • 18
    • 33646134153 scopus 로고    scopus 로고
    • Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection
    • Sengupta S., Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection. Lect. Notes Comput. Sci., 2748 (2003): 79–90.
    • (2003) Lect. Notes Comput. Sci , vol.2748 , pp. 79-90
    • Sengupta, S.1
  • 19
    • 4344646116 scopus 로고    scopus 로고
    • Multi-objective simulated annealing: A comparative study to evolutionary algorithms
    • Nam D., Park C. H., Multi-objective simulated annealing: A comparative study to evolutionary algorithms. Int. J. Fuzzy Syst. 2 (2) (2000): 87–97.
    • (2000) Int. J. Fuzzy Syst , vol.2 , Issue.2 , pp. 87-97
    • Nam, D.1    Park, C.H.2
  • 20
    • 85018104842 scopus 로고    scopus 로고
    • Pareto simulated annealing—a metaheuristic technique for multiple objective combinatorial optimization
    • Czyzak P., Jaszkiewicz A., Pareto simulated annealing—a metaheuristic technique for multiple objective combinatorial optimization. J. Multi-Criteria Decis. Anal. 7 (1) (1998): 34–47.
    • (1998) J. Multi-Criteria Decis. Anal , vol.7 , Issue.1 , pp. 34-47
    • Czyzak, P.1    Jaszkiewicz, A.2
  • 21
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick S., Gelatt C. D., Vecchi M. P., Optimization by simulated annealing. Science 220 (4598) (1983): 671–680.
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 22
    • 0025449198 scopus 로고
    • Simulated annealing: A tool for operational research
    • Eglese R. W., Simulated annealing: A tool for operational research. Eur. J. Oper. Res. 46 (3) (1990): 271–281.
    • (1990) Eur. J. Oper. Res , vol.46 , Issue.3 , pp. 271-281
    • Eglese, R.W.1
  • 24
    • 0002429995 scopus 로고
    • A survey of simulated annealing applications to operations research problems
    • Koulamas C., Antony S. R., Jaen R., A survey of simulated annealing applications to operations research problems. Int. J. Mgmt Sci. 22 (1) (1994): 41–56.
    • (1994) Int. J. Mgmt Sci , vol.22 , Issue.1 , pp. 41-56
    • Koulamas, C.1    Antony, S.R.2    Jaen, R.3
  • 25
    • 0025748279 scopus 로고
    • A theoretical framework for simulated annealing
    • Romeo F., Sangiovanni-Vincentelli A., A theoretical framework for simulated annealing. Algorithmica 6 (3) (1991): 302–345.
    • (1991) Algorithmica , vol.6 , Issue.3 , pp. 302-345
    • Romeo, F.1    Sangiovanni-Vincentelli, A.2
  • 26
    • 2442568808 scopus 로고    scopus 로고
    • Study of simulated annealing based algorithms for multi-objective optimization of a constrained problem
    • Suman B., Study of simulated annealing based algorithms for multi-objective optimization of a constrained problem. Comput. Chem. Engng 28 (9) (2004): 1849–1871.
    • (2004) Comput. Chem. Engng , vol.28 , Issue.9 , pp. 1849-1871
    • Suman, B.1
  • 27
    • 33744522186 scopus 로고    scopus 로고
    • A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain
    • Mansouri S. A., A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain. Comput. Ind. Engng 50 (1) (2006): 105–119.
    • (2006) Comput. Ind. Engng , vol.50 , Issue.1 , pp. 105-119
    • Mansouri, S.A.1
  • 29
    • 84986131501 scopus 로고    scopus 로고
    • Colonial competitive algorithm, a novel approach for PID controller design in MIMO distillation column process
    • Atashpaz-Gargari E., Hashemzadeh F., Rajabioun R., Lucas C., Colonial competitive algorithm, a novel approach for PID controller design in MIMO distillation column process. Int. J. Intell. Comput. Cybernet. 1 (3) (2008): 337–355.
    • (2008) Int. J. Intell. Comput. Cybernet , vol.1 , Issue.3 , pp. 337-355
    • Atashpaz-Gargari, E.1    Hashemzadeh, F.2    Rajabioun, R.3    Lucas, C.4
  • 30
    • 54249121434 scopus 로고    scopus 로고
    • Colonial competitive algorithm as a tool for Nash equilibrium point achievement
    • Rajabioun R., Atashpaz-Gargari E., Lucas C., Colonial competitive algorithm as a tool for Nash equilibrium point achievement. Lect. Notes Comput. Sci., 5073 (2008): 680–695.
    • (2008) Lect. Notes Comput. Sci , vol.5073 , pp. 680-695
    • Rajabioun, R.1    Atashpaz-Gargari, E.2    Lucas, C.3
  • 32
    • 78549242535 scopus 로고    scopus 로고
    • Imperialist competitive algorithm for minimum bit error rate beam forming
    • Khabbazi A., Atashpaz-Gargari E., Lucas C., Imperialist competitive algorithm for minimum bit error rate beam forming. Int. J. Bio-Inspired Comput. 1 (1/2) (2009): 125–133.
    • (2009) Int. J. Bio-Inspired Comput , vol.1 , Issue.1-2 , pp. 125-133
    • Khabbazi, A.1    Atashpaz-Gargari, E.2    Lucas, C.3


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