메뉴 건너뛰기




Volumn 57, Issue 3, 2003, Pages 513-527

Scheduling a batch processing machine with bipartite compatibility graphs

Author keywords

Batch processing machine; Batch scheduling; Bipartite graph; Compatibility graph

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

EID: 21244489698     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s001860300273     Document Type: Article
Times cited : (20)

References (14)
  • 4
    • 29144491587 scopus 로고    scopus 로고
    • Problème d'ordonnancement de tâches sur une machine à traitement par batch
    • to appear
    • Boudhar M, Finke G (2001) Problème d'ordonnancement de tâches sur une machine à traitement par batch. Maghreb Mathematical Review (MMR), to appear
    • (2001) Maghreb Mathematical Review (MMR)
    • Boudhar, M.1    Finke, G.2
  • 5
    • 21244476042 scopus 로고    scopus 로고
    • Scheduling on a single batch processing machine with bipartite compatibility graphs
    • Grenoble, France
    • Boudhar M (2002) Scheduling on a single batch processing machine with bipartite compatibility graphs. Cahiers du laboratoire Leibniz-IMAG 45, Grenoble, France
    • (2002) Cahiers du Laboratoire Leibniz-IMAG , vol.45
    • Boudhar, M.1
  • 10
    • 8544282865 scopus 로고
    • Algorithms and heuristics for scheduling semiconductor burn-in operations
    • University of California, Berkeley, USA
    • Hochbaum D-S, Landy D (1994) Algorithms and heuristics for scheduling semiconductor burn-in operations. Research Report ESRC 94-8, University of California, Berkeley, USA
    • (1994) Research Report ESRC , vol.94 , Issue.8
    • Hochbaum, D.-S.1    Landy, D.2
  • 12
    • 0008337610 scopus 로고    scopus 로고
    • Minimizing total tardiness on a batch processing machine with incompatible job families
    • Mehta S-V, Uzsoy R (1998) Minimizing total tardiness on a batch processing machine with incompatible job families. HE Transaction on Scheduling and Logistics 31:165-178
    • (1998) HE Transaction on Scheduling and Logistics , vol.31 , pp. 165-178
    • Mehta, S.-V.1    Uzsoy, R.2
  • 14
    • 0029387205 scopus 로고
    • Scheduling batch processing machines with incompatible job families
    • Uzsoy R (1995) Scheduling batch processing machines with incompatible job families. International Journal of Production Research 33:2685-2708
    • (1995) International Journal of Production Research , vol.33 , pp. 2685-2708
    • Uzsoy, R.1


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