메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 98, Issue 1-2, 1999, Pages 131-145
Earliness and tardiness scheduling problems on a batch processor
Author keywords

Batch processor; Dynamic programming; Earliness and tardiness; Scheduling
Indexed keywords

EID: 0442297278     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00113-4     Document Type: Article
Times cited : (17)
References (16)
  • 1
    • 0001507294 scopus 로고
    • Batching and scheduling jobs on batch and discrete processors
    • Ahmadi J.H., Ahmadi R.H., Dasu S., Tang C.S. Batching and scheduling jobs on batch and discrete processors. Oper. Res. 40:1992;750-763.
    • (1992) Oper. Res. , vol.40 , pp. 750-763
    • Ahmadi, J.H.1    Ahmadi, R.H.2    Dasu, S.3    Tang, C.S.4
  • 2
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38:1990;22-36.
    • (1990) Oper. Res. , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 3
    • 0027656856 scopus 로고
    • Minimizing total completion time on batch processing machines
    • Chandru V., Lee C.-Y., Uzsoy R. Minimizing total completion time on batch processing machines. Int. J. Prod. Res. 31:1993;2097-2122.
    • (1993) Int. J. Prod. Res. , vol.31 , pp. 2097-2122
    • Chandru, V.1    Lee, C.-Y.2    Uzsoy, R.3
  • 4
    • 0027560273 scopus 로고
    • Minimizing total completion time on a batch processing machine with job families
    • Chandru V., Lee C.-Y., Uzsoy R. Minimizing total completion time on a batch processing machine with job families. Oper. Res. Lett. 13:1993;61-65.
    • (1993) Oper. Res. Lett. , vol.13 , pp. 61-65
    • Chandru, V.1    Lee, C.-Y.2    Uzsoy, R.3
  • 5
    • 0031078986 scopus 로고    scopus 로고
    • Scheduling with batch setup times and earliness-tardiness penalties
    • Chen Z.-L. Scheduling with batch setup times and earliness-tardiness penalties. European J. Oper. Res. 96:1997;518-537.
    • (1997) European J. Oper. Res. , vol.96 , pp. 518-537
    • Chen, Z.-L.1
  • 6
    • 0024010206 scopus 로고
    • One-processor scheduling with symmetric earliness and tardiness penalties
    • Garey M., Tarjan R., Wilfong G. One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13:1988;330-348.
    • (1988) Math. Oper. Res. , vol.13 , pp. 330-348
    • Garey, M.1    Tarjan, R.2    Wilfong, G.3
  • 7
    • 38149058172 scopus 로고
    • Efficient scheduling algorithms for a single batch processing machine
    • Ikura Y., 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
  • 8
    • 0000285949 scopus 로고    scopus 로고
    • Single-machine scheduling with time windows and earliness/tardiness penalties
    • Koulamas C. Single-machine scheduling with time windows and earliness. / tardiness penalties European J. Oper. Res. 91:1996;190-202.
    • (1996) European J. Oper. Res. , vol.91 , pp. 190-202
    • Koulamas, C.1
  • 10
    • 0031077278 scopus 로고    scopus 로고
    • Scheduling with agreeable release times and due dates on a batch processing machine
    • Li C.-L., Lee C.-Y. Scheduling with agreeable release times 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
  • 11
    • 0026898494 scopus 로고
    • Efficient algorithms for scheduling semi-conductor burn-in operations
    • Lee C.-Y., Uzsoy R., Martin-Vega L.A. Efficient algorithms for scheduling semi-conductor burn-in operations. Oper. Res. 40:1992;764-775.
    • (1992) Oper. Res. , vol.40 , pp. 764-775
    • Lee, C.-Y.1    Uzsoy, R.2    Martin-Vega, L.A.3
  • 12
    • 0032003105 scopus 로고    scopus 로고
    • Minimizing total tardiness on a batch processing machine with incompatible job families
    • Mehta S.V., Uzsoy R. Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Trans. 30:1998;165-178.
    • (1998) IIE Trans. , vol.30 , pp. 165-178
    • Mehta, S.V.1    Uzsoy, R.2
  • 13
    • 0030108543 scopus 로고    scopus 로고
    • Single machine scheduling with a common delivery window
    • Ventura J.A., Weng M.X. Single machine scheduling with a common delivery window. J. Oper. Res. Soc. 47:1996;424-434.
    • (1996) J. Oper. Res. Soc. , vol.47 , pp. 424-434
    • Ventura, J.A.1    Weng, M.X.2
  • 14
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • Webster S., Baker K.R. Scheduling groups of jobs on a single machine. Oper. Res. 43:1995;692-703.
    • (1995) Oper. Res. , vol.43 , pp. 692-703
    • Webster, S.1    Baker, K.R.2
  • 15
    • 0029387205 scopus 로고
    • Scheduling batch processing machines with incompatible job families
    • Uzsoy R. Scheduling batch processing machines with incompatible job families. Int. J. Prod. Res. 33:1995;2685-2708.
    • (1995) Int. J. Prod. Res. , vol.33 , pp. 2685-2708
    • Uzsoy, R.1
  • 16
    • 0001961689 scopus 로고    scopus 로고
    • Minimizing total weighted completion time on a single batch processing machine
    • Uzsoy R., Yang Y. Minimizing total weighted completion time on a single batch processing machine. Prod. Oper. Mgmt. 6:1997;57-73.
    • (1997) Prod. Oper. Mgmt. , vol.6 , pp. 57-73
    • Uzsoy, R.1    Yang, Y.2

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