메뉴 건너뛰기




Volumn 2, Issue 1, 2003, Pages 17-35

Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs

Author keywords

batch processing machine; batch scheduling; compatibility graph; split graph

Indexed keywords


EID: 29144438150     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/A:1023669107449     Document Type: Article
Times cited : (15)

References (22)
  • 1
    • 0042639653 scopus 로고
    • Scheduling tasks on two processors with deadlines and additional resources
    • Blazewicz, J., Barcelo, J., Kubiak, W. and Rock, H.: Scheduling tasks on two processors with deadlines and additional resources, European J. Oper. Res. 26 (1986), 364-370.
    • (1986) European J. Oper. Res. , vol.26 , pp. 364-370
    • Blazewicz, J.1    Barcelo, J.2    Kubiak, W.3    Rock, H.4
  • 4
    • 29144491587 scopus 로고    scopus 로고
    • Problème d'ordonnancement de tâches sur une machine à traitement par batch
    • to appear
    • Boudhar, M. and Finke, G.: Problème d'ordonnancement de tâches sur une machine à traitement par batch, Maghreb Math. Rev. (2001), to appear.
    • (2001) Maghreb Math. Rev.
    • Boudhar, M.1    Finke, G.2
  • 5
    • 29144491919 scopus 로고    scopus 로고
    • Static scheduling on a single batch processing machine with split compatibility graphs
    • Boudhar, M.: Static scheduling on a single batch processing machine with split compatibility graphs, Cahiers Lab. Leibniz-IMA Grenoble28 (2001).
    • (2001) Cahiers Lab. Leibniz-IMA Grenoble , vol.28
    • Boudhar, M.1
  • 6
    • 84888617206 scopus 로고    scopus 로고
    • Scheduling on a single batch processing machine with split compatibility graphs, Submitted
    • Boudhar, M.: Scheduling on a single batch processing machine with split compatibility graphs, Submitted (2001).
    • (2001)
    • Boudhar, M.1
  • 7
    • 21244476042 scopus 로고    scopus 로고
    • Scheduling on a single batch processing machine with bipartite compatibility graphs
    • Boudhar, M.: Scheduling on a single batch processing machine with bipartite compatibility graphs, Cahiers Lab. Leibniz-IMA Grenoble45 (2002).
    • (2002) Cahiers Lab. Leibniz-IMA Grenoble , vol.45
    • Boudhar, M.1
  • 10
    • 0027656856 scopus 로고
    • Minimizing total completion time on batch processing machines
    • Chandru, V., Lee, C. Y. and Uzsoy, R.: Minimizing total completion time on batch processing machines, Internat. J. Product. Res. 31 (1993), 2097-2121.
    • (1993) Internat. J. Product. Res. , vol.31 , pp. 2097-2121
    • Chandru, V.1    Lee, C.Y.2    Uzsoy, R.3
  • 11
    • 0004015664 scopus 로고
    • Research Report, University of Rochester, NY: Simon School of Business Administration
    • Dobson, G. and Nambinadom, R. S.: The batch loading and scheduling problem, Research Report, Simon School of Business Administration, University of Rochester, NY, 1992.
    • (1992) The Batch Loading and Scheduling Problem
    • Dobson, G.1    Nambinadom, R.S.2
  • 14
    • 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, Oper. Res. Lett. 5 (1986), 61-65.
    • (1986) Oper. Res. Lett. , vol.5 , pp. 61-65
    • Ikura, Y.1    Gimple, M.2
  • 15
    • 0008348002 scopus 로고    scopus 로고
    • Minimizing earliness/tardiness criteria on a batch processing machine with job families
    • Kubiak, W. and Jolai Ghazvini, F.: Minimizing earliness/tardiness criteria on a batch processing machine with job families, Proc. Second Annual Internat. Conf. Industrial Engineering2 (1997), 785-790.
    • (1997) Proc. Second Annual Internat. Conf. Industrial Engineering , vol.2 , pp. 785-790
    • Kubiak, W.1    Jolai, G.F.2
  • 16
    • 0032804081 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch processing machine with dynamic job arrivals
    • Lee, C. Y. and Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals, Internat. J. Product. Res. 17 (1999), 219-236.
    • (1999) Internat. J. Product. Res. , vol.17 , pp. 219-236
    • Lee, C.Y.1    Uzsoy, R.2
  • 17
    • 0026898494 scopus 로고
    • Efficient algorithms for scheduling semiconductor burn-in operations
    • Lee, C. L., Uzsoy, R. and Martin-Vega, L. A.: Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res. 40 (1992), 764-775.
    • (1992) Oper. Res. , vol.40 , pp. 764-775
    • Lee, C.L.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 18
    • 0031077278 scopus 로고    scopus 로고
    • Scheduling with agreeable release and due dates on a batch processing machine
    • Li, C. L. and Lee, C. Y.: Scheduling with agreeable release and due dates on a batch processing machine, European J. Oper. Res. 96 (1997), 564-569.
    • (1997) European J. Oper. Res. , vol.96 , pp. 564-569
    • Li, C.L.1    Lee, C.Y.2
  • 19
    • 0032003105 scopus 로고    scopus 로고
    • Minimizing total tardiness on a batch processing machine with incompatible job families
    • Mehta, S. V. and Uzsoy, R.: Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Trans. Schedul. Logistics31 (1998), 165-178.
    • (1998) IIE Trans. Schedul. Logistics , vol.31 , pp. 165-178
    • Mehta, S.V.1    Uzsoy, R.2
  • 20
    • 0033895628 scopus 로고    scopus 로고
    • Scheduling with batching: A review
    • Potts, C. N. and Kovalyov, Y. K.: Scheduling with batching: A review, Europ. J. Oper. Res. 120 (2000), 228-249.
    • (2000) Europ. J. Oper. Res. , vol.120 , pp. 228-249
    • Potts, C.N.1    Kovalyov, Y.K.2
  • 22
    • 0029387205 scopus 로고
    • Scheduling batch processing machines with incompatible job families
    • Uzsoy, R.: Scheduling batch processing machines with incompatible job families, Internat. J. Product. Res. 33 (1995), 2685-2708.
    • (1995) Internat. J. Product. Res. , vol.33 , pp. 2685-2708
    • Uzsoy, R.1


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