메뉴 건너뛰기




Volumn 6576 LNCS, Issue , 2011, Pages 520-534

Lorenz versus Pareto dominance in a single machine scheduling problem with rejection

Author keywords

bi objective simulated annealing; Lorenz dominance; Pareto dominance; rejection; Scheduling

Indexed keywords

BI-OBJECTIVE SIMULATED ANNEALING; LORENZ-DOMINANCE; MACHINE ENVIRONMENT; OBJECTIVE FUNCTIONS; PARETO-DOMINANCE; REJECTION; SCHEDULING PROBLEM; SIMULATED ANNEALING ALGORITHMS; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; WEIGHTED COMPLETION; BI OBJECTIVES; LORENZ DOMINANCES; PARETO DOMINANCE;

EID: 79953812193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19893-9_36     Document Type: Conference Paper
Times cited : (14)

References (29)
  • 2
    • 0034911863 scopus 로고    scopus 로고
    • Preemptive multiprocessor scheduling with rejection
    • Seiden, S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science 262, 437-458 (2001)
    • (2001) Theoretical Computer Science , vol.262 , pp. 437-458
    • Seiden, S.1
  • 4
    • 42149152625 scopus 로고    scopus 로고
    • The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
    • Lu, L., Zhang, L., Yuan, J.: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science 396, 283-289 (2008)
    • (2008) Theoretical Computer Science , vol.396 , pp. 283-289
    • Lu, L.1    Zhang, L.2    Yuan, J.3
  • 5
  • 6
    • 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. European Journal of Operational Research 194, 18-27 (2009)
    • (2009) European Journal of Operational Research , vol.194 , pp. 18-27
    • Cheng, Y.1    Sun, S.2
  • 7
    • 62549141448 scopus 로고    scopus 로고
    • Bounded single-machine parallelbatch scheduling with release dates and rejection
    • Lu, L., Cheng, T.C.E., Yuan, J., Zhang, L.: Bounded single-machine parallelbatch scheduling with release dates and rejection. Computers and Operations Research 36, 2748-2751 (2009)
    • (2009) Computers and Operations Research , vol.36 , pp. 2748-2751
    • Lu, L.1    Cheng, T.C.E.2    Yuan, J.3    Zhang, L.4
  • 8
    • 65549157614 scopus 로고    scopus 로고
    • A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
    • Cao, Z., Yang, X.: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science 410, 2732-2745 (2009)
    • (2009) Theoretical Computer Science , vol.410 , pp. 2732-2745
    • Cao, Z.1    Yang, X.2
  • 10
    • 35348949481 scopus 로고    scopus 로고
    • Online scheduling with machine cost and rejection
    • Nagy-György, J., Imreh, Cs.: Online scheduling with machine cost and rejection. Discrete Applied Mathematics 155, 2546-2554 (2007)
    • (2007) Discrete Applied Mathematics , vol.155 , pp. 2546-2554
    • Nagy-György, J.1    Imreh, Cs.2
  • 11
    • 0142245905 scopus 로고    scopus 로고
    • Scheduling for flow-time with admission control
    • Di Battista, G., Zwick, U. (eds.) ESA 2003. Springer, Heidelberg
    • Bansal, N., Blum, A., Chawla, S., Dhamdhere, K.: Scheduling for flow-time with admission control. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 43-54. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2832 , pp. 43-54
    • Bansal, N.1    Blum, A.2    Chawla, S.3    Dhamdhere, K.4
  • 14
    • 83555175583 scopus 로고    scopus 로고
    • Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection
    • Proceedings of the Institution of Mechanical Engineers, doi: 10.1243/09544054JEM1746
    • Jolai, F., Sangari, M.S., Babaie, M.: Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection. In: Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, doi: 10.1243/09544054JEM1746
    • Part B: Journal of Engineering Manufacture
    • Jolai, F.1    Sangari, M.S.2    Babaie, M.3
  • 15
    • 79953828735 scopus 로고    scopus 로고
    • Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost
    • Moghaddam, A., Yalaoui, F., Amodeo, L.: Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost. In: EURO XXIV, Lisbon, Portugal (2010)
    • EURO XXIV, Lisbon, Portugal (2010)
    • Moghaddam, A.1    Yalaoui, F.2    Amodeo, L.3
  • 16
    • 0013458646 scopus 로고
    • The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems
    • Ulungu, E.L., Teghem, J.: The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundation of Computing and Decision Sciences 20(2), 149-165 (1995)
    • (1995) Foundation of Computing and Decision Sciences , vol.20 , Issue.2 , pp. 149-165
    • Ulungu, E.L.1    Teghem, J.2
  • 17
    • 79953812665 scopus 로고    scopus 로고
    • Simulated annealing for a bi-objective scheduling problem with rejection: Comparative study
    • Moghaddam, A., Amodeo, L., Yalaoui, F.: Simulated annealing for a bi-objective scheduling problem with rejection: comparative study. In: META 2010, Djerba, Tunisia (2010)
    • (2010) META 2010, Djerba, Tunisia
    • Moghaddam, A.1    Amodeo, L.2    Yalaoui, F.3
  • 18
    • 70350572217 scopus 로고    scopus 로고
    • New multi-objective method to solve reentrant hybrid flow shop scheduling problem
    • Dugardin, F., Yalaoui, F., Amodeo, L.: New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research 203, 22-31 (2010)
    • (2010) European Journal of Operational Research , vol.203 , pp. 22-31
    • Dugardin, F.1    Yalaoui, F.2    Amodeo, L.3
  • 20
    • 77956035689 scopus 로고    scopus 로고
    • Infinite order Lorenz dominance for fair multiagent optimization
    • van der Hoek, W., Kaminka, G.A., Lespérance, Y., Luck, M., Sen, S.: (eds.)
    • Golden, B., Perny, P.: Infinite order Lorenz dominance for fair multiagent optimization. In: van der Hoek, W., Kaminka, G.A., Lespérance, Y., Luck, M., Sen, S.: (eds.) Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10-14, pp. 383-390 (2010)
    • (2010) Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10-14 , pp. 383-390
    • Golden, B.1    Perny, P.2
  • 21
    • 33749361938 scopus 로고    scopus 로고
    • A decision-theoretic approach to robust optimization in multivalued graphs
    • Perny, P., Spanjaard, O., Storme, L.-X.: A decision-theoretic approach to robust optimization in multivalued graphs. Annals of Operations Research 147, 317-341 (2006)
    • (2006) Annals of Operations Research , vol.147 , pp. 317-341
    • Perny, P.1    Spanjaard, O.2    Storme, L.-X.3
  • 22
    • 79953814934 scopus 로고    scopus 로고
    • Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost
    • to be submitted
    • Moghaddam, A., Amodeo, L., Yalaoui, F.: Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost. Journal of Mathematical Modelling and Algorithms (to be submitted)
    • Journal of Mathematical Modelling and Algorithms
    • Moghaddam, A.1    Amodeo, L.2    Yalaoui, F.3
  • 23
    • 34250381644 scopus 로고
    • Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems
    • McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. Mathematical Programming 10, 146-175 (1976)
    • (1976) Mathematical Programming , vol.10 , pp. 146-175
    • McCormick, G.P.1
  • 24
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671-680 (1983)
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 25
    • 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. Computers and Industrial Engineering, 1-15 (2006)
    • (2006) Computers and Industrial Engineering , pp. 1-15
    • Mansouri, S.A.1
  • 26
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • Varadharajan, T.K., Rajendran, C.: A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 167, 772-795 (2005)
    • (2005) European Journal of Operational Research , vol.167 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2
  • 29
    • 33645153207 scopus 로고    scopus 로고
    • Comparing genetic algorithms and tabu search for multi-objective optimization
    • Riise, A.: Comparing genetic algorithms and tabu search for multi-objective optimization. In: IFORS, Proceedings of Abstract Conference, p. 29 (2002)
    • (2002) IFORS, Proceedings of Abstract Conference , pp. 29
    • Riise, A.1


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