메뉴 건너뛰기




Volumn 199, Issue 1, 2009, Pages 55-67

Scheduling interfering job sets on parallel machines

Author keywords

Bicriteria scheduling; Interfering job sets; Parallel machines

Indexed keywords

BI CRITERION; BICRITERIA SCHEDULING; COMPUTATIONALLY EFFICIENT; DECISION MAKERS; DISJOINT SETS; ENCODING SCHEMES; IDENTICAL PARALLEL MACHINES; INTEGER PROGRAMMING FORMULATIONS; INTERFERING JOB SETS; MAKESPAN; NON-DOMINATED SOLUTIONS; NP-HARD; PARALLEL MACHINES; PROBLEM STRUCTURES; SOLUTION QUALITIES; TOTAL COMPLETION TIME;

EID: 67349246469     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.10.038     Document Type: Article
Times cited : (41)

References (26)
  • 4
    • 3543134227 scopus 로고    scopus 로고
    • A multiple criterion model for machine scheduling
    • Baker K., and Smith J.C. A multiple criterion model for machine scheduling. Journal of Scheduling 6 (2003) 7-16
    • (2003) Journal of Scheduling , vol.6 , pp. 7-16
    • Baker, K.1    Smith, J.C.2
  • 5
    • 0003766238 scopus 로고
    • PhD thesis, University of Alberta, Edmonton, Department of Computer Science
    • Brindle, A., 1981. Genetic Algorithms for Function Optimization. PhD thesis, University of Alberta, Edmonton, Department of Computer Science.
    • (1981) Genetic Algorithms for Function Optimization
    • Brindle, A.1
  • 7
    • 0041912462 scopus 로고    scopus 로고
    • Quantitative comparison of approximate solution sets for bicriteria optimization problems
    • Carlyle M., Fowler J., Gel E., and Kim B. Quantitative comparison of approximate solution sets for bicriteria optimization problems. Decision Sciences 34 1 (2003)
    • (2003) Decision Sciences , vol.34 , Issue.1
    • Carlyle, M.1    Fowler, J.2    Gel, E.3    Kim, B.4
  • 8
    • 33748545910 scopus 로고    scopus 로고
    • Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
    • Cheng T.C.E., Ng C.T., and Yuan J.J. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science 12 (2006) 273-281
    • (2006) Theoretical Computer Science , vol.12 , pp. 273-281
    • Cheng, T.C.E.1    Ng, C.T.2    Yuan, J.J.3
  • 9
    • 33749637199 scopus 로고    scopus 로고
    • A note on the complexity of the two-agent scheduling problem on a single machine
    • Cheng T.C.E., Ng C.T., and Yuan J.J. A note on the complexity of the two-agent scheduling problem on a single machine. Journal of Combinatorial Optimization 12 (2006) 387-394
    • (2006) Journal of Combinatorial Optimization , vol.12 , pp. 387-394
    • Cheng, T.C.E.1    Ng, C.T.2    Yuan, J.J.3
  • 11
    • 85018104842 scopus 로고    scopus 로고
    • Pareto simulated annealing - a metaheuristic technique for multiple-objective combinatorial optimization
    • Cyzak P., and Jaszkiewicz A. Pareto simulated annealing - a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multicriteria Decision Analysis 7 (1998) 34-47
    • (1998) Journal of Multicriteria Decision Analysis , vol.7 , pp. 34-47
    • Cyzak, P.1    Jaszkiewicz, A.2
  • 12
    • 84947926042 scopus 로고    scopus 로고
    • A fast elitist non-dominated sorting genetic algorithm for multiobjective optimization: NSGA II
    • Springer
    • Deb K., Agrawal S., Pratap A., and Meyarivan T. A fast elitist non-dominated sorting genetic algorithm for multiobjective optimization: NSGA II. Parallel Problem Solving from Nature - PPSN VI (2000), Springer 849-858
    • (2000) Parallel Problem Solving from Nature - PPSN VI , pp. 849-858
    • Deb, K.1    Agrawal, S.2    Pratap, A.3    Meyarivan, T.4
  • 14
    • 0000904077 scopus 로고
    • Messy genetic algorithms: motivation, analysis and first results
    • Goldberg D., Korb B., and Deb K. Messy genetic algorithms: motivation, analysis and first results. Complex Systems 3 (1990) 493-530
    • (1990) Complex Systems , vol.3 , pp. 493-530
    • Goldberg, D.1    Korb, B.2    Deb, K.3
  • 15
    • 74849101820 scopus 로고
    • Optimization and approximation of deterministic sequencing and scheduling: a survey
    • Graham R., Lawler E., Lenstra J., and Rinnooy Kan A. Optimization and approximation of deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
    • (1979) Annals of Discrete Mathematics , vol.5 , pp. 287-326
    • Graham, R.1    Lawler, E.2    Lenstra, J.3    Rinnooy Kan, A.4
  • 16
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessor anomalies
    • Graham R.L. Bounds for certain multiprocessor anomalies. Bell System Technical Journal 17 (1966) 1563-1581
    • (1966) Bell System Technical Journal , vol.17 , pp. 1563-1581
    • Graham, R.L.1
  • 18
    • 33645528689 scopus 로고    scopus 로고
    • A tutorial on multiobjective metaheuristics for scheduling and timetabling
    • Gandibleux X., Sevaux M., Sorenson K., and T'Kindt V. (Eds), Springer
    • Landa Silva J., and Burke E. A tutorial on multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux X., Sevaux M., Sorenson K., and T'Kindt V. (Eds). Multiple Objective Metaheuristics (2004), Springer
    • (2004) Multiple Objective Metaheuristics
    • Landa Silva, J.1    Burke, E.2
  • 19
    • 28444482292 scopus 로고    scopus 로고
    • Using diversity to guide the search in multi-objective optimization
    • Coello Coello C., and Lamont G. (Eds), World Scientific
    • Landa Silva J., and Burke E. Using diversity to guide the search in multi-objective optimization. In: Coello Coello C., and Lamont G. (Eds). Applications of Multi-Objective Evolutionary Algorithms (2004), World Scientific
    • (2004) Applications of Multi-Objective Evolutionary Algorithms
    • Landa Silva, J.1    Burke, E.2
  • 20
    • 0001880962 scopus 로고
    • Parallel machines scheduling with nonsimultaneous machine available time
    • Lee C. Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics 20 (1991) 53-61
    • (1991) Discrete Applied Mathematics , vol.20 , pp. 53-61
    • Lee, C.1
  • 21
    • 5144232432 scopus 로고    scopus 로고
    • Solving multi-objective production scheduling problems using metaheurisitics
    • Loukil T., Teghem J., and Tuyttens D. Solving multi-objective production scheduling problems using metaheurisitics. European Journal of Operational Research 161 (2005) 42-61
    • (2005) European Journal of Operational Research , vol.161 , pp. 42-61
    • Loukil, T.1    Teghem, J.2    Tuyttens, D.3
  • 22
    • 29344433807 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for scheduling flow shops to minimize the makespan and total flow time of jobs
    • Pasupathy T., Rajendran C., and Suresh R. A multi-objective genetic algorithm for scheduling flow shops to minimize the makespan and total flow time of jobs. International Journal of Advanced Manufacturing Technology 27 (2006) 804-815
    • (2006) International Journal of Advanced Manufacturing Technology , vol.27 , pp. 804-815
    • Pasupathy, T.1    Rajendran, C.2    Suresh, R.3
  • 23
    • 0005184581 scopus 로고
    • Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time
    • Peha J. Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time. Journal of Computers and Operations Research 22 10 (1995) 1089-1100
    • (1995) Journal of Computers and Operations Research , vol.22 , Issue.10 , pp. 1089-1100
    • Peha, J.1
  • 24
    • 0032362468 scopus 로고    scopus 로고
    • Machine scheduling with availability constraintsm
    • Sanlaville E., and Schmidt G. Machine scheduling with availability constraintsm. Acta Informatica 35 9 (1998) 795-811
    • (1998) Acta Informatica , vol.35 , Issue.9 , pp. 795-811
    • Sanlaville, E.1    Schmidt, G.2
  • 25
    • 34249830539 scopus 로고
    • A time-indexed integer programming formulation for non-preemptive single machine scheduling problems
    • Sousa J., and Wolsey L. A time-indexed integer programming formulation for non-preemptive single machine scheduling problems. Mathematical Programming 54A 3 (1992) 353-367
    • (1992) Mathematical Programming , vol.54 A , Issue.3 , pp. 353-367
    • Sousa, J.1    Wolsey, L.2


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