메뉴 건너뛰기




Volumn 36, Issue 1, 2009, Pages 110-118

Bicriterion scheduling with equal processing times on a batch processing machine

Author keywords

Batch processing machine; Bicriterion; Scheduling

Indexed keywords

POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 44849130696     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.07.007     Document Type: Article
Times cited : (21)

References (14)
  • 2
    • 0026898494 scopus 로고
    • Efficient algorithm for scheduling semiconductor burn-in operations
    • Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithm for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 764-775
    • (1992) Operations Research , vol.40 , pp. 764-775
    • Lee, C.Y.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 3
    • 0002066821 scopus 로고
    • Various optimizers for single stage production
    • Smith W.E. Various optimizers for single stage production. Naval Research Logistics Quarterly 3 (1956) 59-66
    • (1956) Naval Research Logistics Quarterly , vol.3 , pp. 59-66
    • Smith, W.E.1
  • 4
    • 0002719862 scopus 로고
    • Scheduling unit processing time jobs on a single machine with multiple criteria
    • Chen C.L., and Bulfin R.L. Scheduling unit processing time jobs on a single machine with multiple criteria. Computers and Operations Research 17 (1990) 1-7
    • (1990) Computers and Operations Research , vol.17 , pp. 1-7
    • Chen, C.L.1    Bulfin, R.L.2
  • 5
    • 0025692635 scopus 로고
    • Minimizing the flow time and missed due dates in a single machine sequencing
    • Cheng T.C.E. Minimizing the flow time and missed due dates in a single machine sequencing. Mathematical and Computer Modeling 13 (1990) 71-77
    • (1990) Mathematical and Computer Modeling , vol.13 , pp. 71-77
    • Cheng, T.C.E.1
  • 6
    • 0027912254 scopus 로고
    • Complexity of single machine, multi-criteria scheduling problems
    • Chen C.L., and Bulfin R.L. Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research 70 (1993) 115-125
    • (1993) European Journal of Operational Research , vol.70 , pp. 115-125
    • Chen, C.L.1    Bulfin, R.L.2
  • 9
    • 38149058172 scopus 로고
    • Efficient scheduling algorithms for a single batch processing machine
    • Ikura Y., and Gimple M. Efficient scheduling algorithms for a single batch processing machine. Operations Research letters 5 (1986) 61-65
    • (1986) Operations Research letters , vol.5 , pp. 61-65
    • Ikura, Y.1    Gimple, M.2
  • 13
    • 0000062028 scopus 로고
    • An n jobs, one machine sequencing algorithm for minimizing the number of late jobs
    • Moore J.M. An n jobs, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 102-109
    • (1968) Management Science , vol.15 , pp. 102-109
    • Moore, J.M.1
  • 14
    • 0039952596 scopus 로고
    • A shortest augmenting path algorithm for the semi-assignment problem
    • Kennington J., and Wang Z. A shortest augmenting path algorithm for the semi-assignment problem. Operations Research 40 (1992) 178-187
    • (1992) Operations Research , vol.40 , pp. 178-187
    • Kennington, J.1    Wang, Z.2


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