메뉴 건너뛰기




Volumn 37, Issue 12, 2010, Pages 2218-2228

Optimal due date assignment and resource allocation in a group technology scheduling environment

Author keywords

Earlinesstardiness; Family due date assignment method; Group technology; Resource allocation; Single machine scheduling

Indexed keywords

DUE DATES; DUE-DATE ASSIGNMENT; EARLINESS-TARDINESS; FAMILY DUE DATE ASSIGNMENT METHOD; HIGH-VOLUME PRODUCTION; JOB PROCESSING TIME; MAKESPAN; OBJECTIVE FUNCTIONS; RESOURCE CONSUMPTION; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING;

EID: 77955275487     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.03.012     Document Type: Article
Times cited : (43)

References (42)
  • 1
    • 0027906633 scopus 로고
    • Two parallel machine sequencing problems involving controllable job processing times
    • B. Alidaee, and A. Ahmadian Two parallel machine sequencing problems involving controllable job processing times European Journal of Operational Research 70 1993 335 341
    • (1993) European Journal of Operational Research , vol.70 , pp. 335-341
    • Alidaee, B.1    Ahmadian, A.2
  • 2
    • 0022714365 scopus 로고
    • Minimizing mean absolute deviation of completion times about a common due date
    • U. Bagchi, R.S. Sullivan, and Y.L. Chang Minimizing mean absolute deviation of completion times about a common due date Naval Research Logistics 33 1986 227 240
    • (1986) Naval Research Logistics , vol.33 , pp. 227-240
    • Bagchi, U.1    Sullivan, R.S.2    Chang, Y.L.3
  • 3
    • 0001723283 scopus 로고
    • Minimizing mean squared deviation of completion times about a common due date
    • U. Bagchi, R.S. Sullivan, and Y.L. Chang Minimizing mean squared deviation of completion times about a common due date Management Science 33 1986 894 906
    • (1986) Management Science , vol.33 , pp. 894-906
    • Bagchi, U.1    Sullivan, R.S.2    Chang, Y.L.3
  • 4
    • 0346461742 scopus 로고    scopus 로고
    • A note on due-date assignment in a two-machine flow-shop
    • M. Birman, and G. Mosheiov A note on due-date assignment in a two-machine flow-shop Computers and Operations Research 31 3 2004 473 480
    • (2004) Computers and Operations Research , vol.31 , Issue.3 , pp. 473-480
    • Birman, M.1    Mosheiov, G.2
  • 5
    • 0000216272 scopus 로고    scopus 로고
    • Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
    • D. Biskup, and T.C.E. Cheng Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties Engineering Optimization 31 1999 329 336
    • (1999) Engineering Optimization , vol.31 , pp. 329-336
    • Biskup, D.1    Cheng, T.C.E.2
  • 6
    • 0035852851 scopus 로고    scopus 로고
    • Common due date assignment for scheduling on a single machine with jointly reducible processing times
    • D. Biskup, and H. Jahnke Common due date assignment for scheduling on a single machine with jointly reducible processing times International Journal of Production Economics 69 2001 317 322
    • (2001) International Journal of Production Economics , vol.69 , pp. 317-322
    • Biskup, D.1    Jahnke, H.2
  • 7
    • 0030145046 scopus 로고    scopus 로고
    • Due-date assignment and single machine scheduling with compressible processing times
    • T.C.E. Cheng, C. Oaz, and X.D. Qi Due-date assignment and single machine scheduling with compressible processing times International Journal of Production Economics 43 1996 29 35
    • (1996) International Journal of Production Economics , vol.43 , pp. 29-35
    • Cheng, T.C.E.1    Oaz, C.2    Qi, X.D.3
  • 8
    • 33748430703 scopus 로고    scopus 로고
    • Scheduling with controllable release dates and processing times: Total completion time minimization
    • DOI 10.1016/j.ejor.2005.06.072, PII S0377221706000476
    • T.C.E. Cheng, M.Y. Kovalyov, and N. Shakhlevich Scheduling with controllable release dates and processing times: total completion time minimization European Journal of Operational Research 175 2006 769 781 (Pubitemid 44345107)
    • (2006) European Journal of Operational Research , vol.175 , Issue.2 , pp. 769-781
    • Cheng, T.C.E.1    Kovalyov, M.Y.2    Shakhlevich, N.V.3
  • 10
    • 84985765941 scopus 로고
    • Optimal delivery time quotation and order sequencing
    • P. De, J.B. Ghosh, and C.E. Wells Optimal delivery time quotation and order sequencing Decision Sciences 22 1991 379 390
    • (1991) Decision Sciences , vol.22 , pp. 379-390
    • De, P.1    Ghosh, J.B.2    Wells, C.E.3
  • 11
    • 0037118177 scopus 로고    scopus 로고
    • A survey of the state-of-the-art of common due date assignment and scheduling research
    • V. Gordon, J.M. Proth, and C.B. Chu A survey of the state-of-the-art of common due date assignment and scheduling research European Journal of Operational Research 139 2002 1 25
    • (2002) European Journal of Operational Research , vol.139 , pp. 1-25
    • Gordon, V.1    Proth, J.M.2    Chu, C.B.3
  • 14
    • 0023518955 scopus 로고
    • One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
    • A. Janiak One-machine scheduling with allocation of continuously- divisible resource and with no precedence constraints Kybernetika 23 4 1987 289 293
    • (1987) Kybernetika , vol.23 , Issue.4 , pp. 289-293
    • Janiak, A.1
  • 15
    • 0030263104 scopus 로고    scopus 로고
    • Single machine scheduling subject to deadlines and resource dependent processing times
    • A. Janiak, and M.Y. Kovalyov Single machine scheduling subject to deadlines and resource dependent processing times European Journal of Operational Research 94 1996 284 291
    • (1996) European Journal of Operational Research , vol.94 , pp. 284-291
    • Janiak, A.1    Kovalyov, M.Y.2
  • 16
    • 0142093797 scopus 로고    scopus 로고
    • Some single machine scheduling problems with resource dependent set-up and processing times
    • Dresden, September (2000) , Springer-Verlag
    • Janiak A, Lichtenstein M. Some single machine scheduling problems with resource dependent set-up and processing times. In: Selected Papers of the Symposium on Operations Research (OR 2000), Dresden, September (2000), Springer-Verlag, 2001, pp. 606.
    • (2001) Selected Papers of the Symposium on Operations Research (OR 2000) , pp. 60-66
    • Janiak, A.1    Lichtenstein, M.2
  • 17
  • 18
    • 0008346991 scopus 로고    scopus 로고
    • Batch scheduling and common due-date assignment on a single machine
    • T.C.E. Cheng, and M.Y. Kovalyov Batch scheduling and common due-date assignment on a single machine Discrete Applied Mathematics 70 1996 231 245
    • (1996) Discrete Applied Mathematics , vol.70 , pp. 231-245
    • Cheng, T.C.E.1    Kovalyov, M.Y.2
  • 19
    • 15244358285 scopus 로고    scopus 로고
    • Group scheduling with controllable setup and processing times: Minimizing total weighted completion time
    • C.T.D. Ng, T.C.E. Cheng, A. Janiak, and M.Y. Kovalyov Group scheduling with controllable setup and processing times: minimizing total weighted completion time Annals of Operations Research 133 2005 163 174
    • (2005) Annals of Operations Research , vol.133 , pp. 163-174
    • Ng, C.T.D.1    Cheng, T.C.E.2    Janiak, A.3    Kovalyov, M.Y.4
  • 20
    • 38249000672 scopus 로고
    • Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
    • H.G. Kahlbacher, and T.C.E. Cheng Parallel machine scheduling to minimize costs for earliness and number of tardy jobs Discrete Applied Mathematics 47 1993 139 164
    • (1993) Discrete Applied Mathematics , vol.47 , pp. 139-164
    • Kahlbacher, H.G.1    Cheng, T.C.E.2
  • 21
    • 0242301620 scopus 로고    scopus 로고
    • Optimization of machining economics problem for a multi-stage transfer machine under failure opportunistic and integrated replacement strategies
    • M. Kaspi, and D. Shabtay Optimization of machining economics problem for a multi-stage transfer machine under failure opportunistic and integrated replacement strategies International Journal of Production Research 41 10 2003 2229 2248
    • (2003) International Journal of Production Research , vol.41 , Issue.10 , pp. 2229-2248
    • Kaspi, M.1    Shabtay, D.2
  • 22
    • 13544276185 scopus 로고    scopus 로고
    • A new bounding mechanism for the CNC machine scheduling problem with controllable processing times
    • R.K. Kayan, and M.S. Akturk A new bounding mechanism for the CNC machine scheduling problem with controllable processing times European Journal of Operational Research 167 2005 624 643
    • (2005) European Journal of Operational Research , vol.167 , pp. 624-643
    • Kayan, R.K.1    Akturk, M.S.2
  • 23
    • 0035637004 scopus 로고    scopus 로고
    • Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
    • C.Y. Lee, and L. Lei Multiple-project scheduling with controllable project duration and hard resource constraint: some solvable cases Annals of Operations Research 102 2001 287 307
    • (2001) Annals of Operations Research , vol.102 , pp. 287-307
    • Lee, C.Y.1    Lei, L.2
  • 25
    • 0035400730 scopus 로고    scopus 로고
    • A common due-date assignment problem on parallel identical machines
    • G. Mosheiov A common due-date assignment problem on parallel identical machines Computers and Operations Research 28 8 2001 719 732
    • (2001) Computers and Operations Research , vol.28 , Issue.8 , pp. 719-732
    • Mosheiov, G.1
  • 26
    • 0037410951 scopus 로고    scopus 로고
    • Single machine scheduling with a variable common due date and resource-dependent processing times
    • C.T.D. Ng, T.C.E. Cheng, M.Y. Kovalyov, and S.S. Lam Single machine scheduling with a variable common due date and resource-dependent processing times Computer and Operations Research 30 2003 1173 1185
    • (2003) Computer and Operations Research , vol.30 , pp. 1173-1185
    • Ng, C.T.D.1    Cheng, T.C.E.2    Kovalyov, M.Y.3    Lam, S.S.4
  • 27
    • 17444423668 scopus 로고    scopus 로고
    • Minimizing completion time variance with compressible processing times
    • C.T. Ng, X. Cai, T.C.E. Cheng, and S.S. Lam Minimizing completion time variance with compressible processing times Journal of Global Optimization 31 2005 333 352
    • (2005) Journal of Global Optimization , vol.31 , pp. 333-352
    • Ng, C.T.1    Cai, X.2    Cheng, T.C.E.3    Lam, S.S.4
  • 28
    • 38249019311 scopus 로고
    • A survey of results for sequencing problems with controllable processing times
    • E. Nowicki, and S. Zdrzalka A survey of results for sequencing problems with controllable processing times Discrete Applied Mathematics 26 1990 271 287
    • (1990) Discrete Applied Mathematics , vol.26 , pp. 271-287
    • Nowicki, E.1    Zdrzalka, S.2
  • 30
    • 0020103079 scopus 로고
    • Common due date assignment to minimize total penalty for the one machine scheduling problem
    • S.S. Panwalkar, M.L. Smith, and A. Seidmann Common due date assignment to minimize total penalty for the one machine scheduling problem Operations Research 30 1982 391 399
    • (1982) Operations Research , vol.30 , pp. 391-399
    • Panwalkar, S.S.1    Smith, M.L.2    Seidmann, A.3
  • 34
    • 1642286063 scopus 로고    scopus 로고
    • Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem
    • D. Shabtay Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem Computers and Operations Research 31 8 2004 1303 1315
    • (2004) Computers and Operations Research , vol.31 , Issue.8 , pp. 1303-1315
    • Shabtay, D.1
  • 35
    • 2942731249 scopus 로고    scopus 로고
    • Minimizing the total weighted flow time in a single machine with controllable processing times
    • D. Shabtay, and M. Kaspi Minimizing the total weighted flow time in a single machine with controllable processing times Computers and Operations Research 31 13 2004 2279 2289
    • (2004) Computers and Operations Research , vol.31 , Issue.13 , pp. 2279-2289
    • Shabtay, D.1    Kaspi, M.2
  • 36
    • 34547460828 scopus 로고    scopus 로고
    • The earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
    • New York, NY
    • Shabtay D, Steiner G. The earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. In: Proceedings of the MISTA 2005 Conference, New York, NY, 2005, pp. 14961.
    • (2005) Proceedings of the MISTA 2005 Conference , pp. 149-161
    • Shabtay, D.1    Steiner, G.2
  • 37
    • 34848827877 scopus 로고    scopus 로고
    • Single machine batch scheduling to minimize total completion time and resource consumption costs
    • DOI 10.1007/s10951-007-0025-9
    • D. Shabtay, and G. Steiner Single machine batch scheduling to minimize total completion time and resource consumption costs Journal of Scheduling 10 2007 255 261 (Pubitemid 47501048)
    • (2007) Journal of Scheduling , vol.10 , Issue.4-5 , pp. 255-261
    • Shabtay, D.1    Steiner, G.2
  • 38
    • 34547404222 scopus 로고    scopus 로고
    • A survey of scheduling with controllable processing times
    • D. Shabtay, and G. Steiner A survey of scheduling with controllable processing times Discrete Applied Mathematics 155 13 2007 1643 1666
    • (2007) Discrete Applied Mathematics , vol.155 , Issue.13 , pp. 1643-1666
    • Shabtay, D.1    Steiner, G.2
  • 39
    • 33847713661 scopus 로고    scopus 로고
    • The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times
    • D. Shabtay, M. Kaspi, and G. Steiner The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times IIE Transactions 39 5 2007 539 557
    • (2007) IIE Transactions , vol.39 , Issue.5 , pp. 539-557
    • Shabtay, D.1    Kaspi, M.2    Steiner, G.3
  • 40
    • 33746868325 scopus 로고    scopus 로고
    • Single machine scheduling with controllable release and processing times
    • N.V. Shakhlevich, and V.A. Strusevich Single machine scheduling with controllable release and processing times Discrete Applied Mathematics 154 2006 2178 2199
    • (2006) Discrete Applied Mathematics , vol.154 , pp. 2178-2199
    • Shakhlevich, N.V.1    Strusevich, V.A.2
  • 41
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • W.E. Smith 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
  • 42
    • 0028383503 scopus 로고
    • Scheduling multiple variable-speed machines
    • M. Trick Scheduling multiple variable-speed machines Operations Research 42 1994 234 248
    • (1994) Operations Research , vol.42 , pp. 234-248
    • Trick, M.1


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