메뉴 건너뛰기




Volumn 177, Issue 1, 2007, Pages 638-645

Single machine scheduling problems with controllable processing times and total absolute differences penalties

Author keywords

Controllable processing times; Scheduling; Single machine

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DATA COMPRESSION; OPTIMIZATION; SCHEDULING;

EID: 33750462332     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.10.054     Document Type: Article
Times cited : (38)

References (25)
  • 1
    • 0027906633 scopus 로고
    • Two parallel machine sequencing problems involving controllable job processing times
    • Alidaee B., and Ahmadian A. Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research 70 3 (1993) 335-341
    • (1993) European Journal of Operational Research , vol.70 , Issue.3 , pp. 335-341
    • Alidaee, B.1    Ahmadian, A.2
  • 2
    • 0006183587 scopus 로고    scopus 로고
    • A framework for machine scheduling problems with controllable processing times
    • Alidaee B., and Kochenberger G. A framework for machine scheduling problems with controllable processing times. Production and Operations Management 5 4 (1996) 391-405
    • (1996) Production and Operations Management , vol.5 , Issue.4 , pp. 391-405
    • Alidaee, B.1    Kochenberger, G.2
  • 3
    • 0024480571 scopus 로고
    • Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems
    • Bagchi U.B. Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Operations Research 37 (1989) 118-125
    • (1989) Operations Research , vol.37 , pp. 118-125
    • Bagchi, U.B.1
  • 4
    • 0000216272 scopus 로고    scopus 로고
    • Single machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
    • Biskup D., and Cheng T.C.E. 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
  • 5
    • 0035852851 scopus 로고    scopus 로고
    • Common due date assignment for scheduling on a single machine with jointly reducible processing times
    • Biskup D., and Jahnke H. 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
  • 6
    • 0028449763 scopus 로고
    • Resource optimal control in some single machine scheduling problems
    • Cheng T.C.E., and Janiak A. Resource optimal control in some single machine scheduling problems. IEEE Transactions on Automatic Control 39 (1994) 1243-1246
    • (1994) IEEE Transactions on Automatic Control , vol.39 , pp. 1243-1246
    • Cheng, T.C.E.1    Janiak, A.2
  • 7
    • 0030145046 scopus 로고    scopus 로고
    • Due-date assignment and single machine scheduling with compressible processing times
    • Cheng T.C.E., Og ̌uz C., and Qi X.D. 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    Og ̌uz, C.2    Qi, X.D.3
  • 8
    • 0024769314 scopus 로고
    • Single machine scheduling with controllable processing times and number of jobs tardy
    • Daniels R.L., and Sarin R.K. Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research 37 (1989) 981-984
    • (1989) Operations Research , vol.37 , pp. 981-984
    • Daniels, R.L.1    Sarin, R.K.2
  • 9
    • 0017460225 scopus 로고
    • Minimizing waiting time variance in the single machine problem
    • Eilon S., and Chowdhury I.E. Minimizing waiting time variance in the single machine problem. Management Science 23 (1977) 567-575
    • (1977) Management Science , vol.23 , pp. 567-575
    • Eilon, S.1    Chowdhury, I.E.2
  • 11
    • 0036096594 scopus 로고    scopus 로고
    • Some comments on sequencing with controllable processing times
    • Hoogeveen H., and Woeginger G.J. Some comments on sequencing with controllable processing times. Computing 68 (2002) 181-192
    • (2002) Computing , vol.68 , pp. 181-192
    • Hoogeveen, H.1    Woeginger, G.J.2
  • 12
    • 0019704009 scopus 로고
    • Minimizing variation of flow time in single machine systems
    • Kanet J.J. Minimizing variation of flow time in single machine systems. Management Science 27 12 (1981) 1453-1459
    • (1981) Management Science , vol.27 , Issue.12 , pp. 1453-1459
    • Kanet, J.J.1
  • 13
    • 0001127702 scopus 로고
    • Variance minimization in single machine sequencing problems
    • Merten A.G., and Muller M.E. Variance minimization in single machine sequencing problems. Management Science 18 (1972) 518-528
    • (1972) Management Science , vol.18 , pp. 518-528
    • Merten, A.G.1    Muller, M.E.2
  • 14
    • 0037410951 scopus 로고    scopus 로고
    • Single machine scheduling with a variable common due date and resource-dependent processing times
    • Ng C.T.D., Cheng T.C.E., Kovalyov M.Y., and Lam S.S. Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research 30 (2003) 1173-1185
    • (2003) Computers 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
  • 15
    • 1642410098 scopus 로고    scopus 로고
    • Single machine batch scheduling with jointly compressible setup and processing times
    • Ng C.T.D., Cheng T.C.E., and Kovalyov M.Y. Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research 153 (2004) 211-219
    • (2004) European Journal of Operational Research , vol.153 , pp. 211-219
    • Ng, C.T.D.1    Cheng, T.C.E.2    Kovalyov, M.Y.3
  • 16
    • 0023983808 scopus 로고
    • A two machine flow shop scheduling problem with controllable job processing times
    • Nowicki E., and Zdrzalka S. A two machine flow shop scheduling problem with controllable job processing times. European Journal of Operational Research 34 (1988) 208-220
    • (1988) European Journal of Operational Research , vol.34 , pp. 208-220
    • Nowicki, E.1    Zdrzalka, S.2
  • 17
    • 38249019311 scopus 로고
    • A survey of results for sequencing problems with controllable processing times
    • Nowicki E., and Zdrzalka S. 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
  • 19
    • 0001459264 scopus 로고
    • Minimizing the time-in-system variance for a finite jobset
    • Schrage L. Minimizing the time-in-system variance for a finite jobset. Management Science 21 (1975) 540-543
    • (1975) Management Science , vol.21 , pp. 540-543
    • Schrage, L.1
  • 20
    • 2942731249 scopus 로고    scopus 로고
    • Minimizing the total weighted flow time in a single machine with controllable processing times
    • Shabtay D., and Kaspi M. Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research 31 (2004) 2279-2289
    • (2004) Computers and Operations Research , vol.31 , pp. 2279-2289
    • Shabtay, D.1    Kaspi, M.2
  • 22
    • 0023170104 scopus 로고
    • Deterministic and random single machine sequencing with variance minimization
    • Vani V., and Raghavachari M. Deterministic and random single machine sequencing with variance minimization. Operations Research 35 (1987) 111-120
    • (1987) Operations Research , vol.35 , pp. 111-120
    • Vani, V.1    Raghavachari, M.2
  • 23
    • 0019058538 scopus 로고
    • Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine
    • Vickson R.G. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research 29 (1980) 1155-1167
    • (1980) Operations Research , vol.29 , pp. 1155-1167
    • Vickson, R.G.1
  • 24
    • 0019055358 scopus 로고
    • Two single-machine sequencing problems involving controllable job processing times
    • Vickson R.G. Two single-machine sequencing problems involving controllable job processing times. AIIE Transactions 12 (1980) 258-262
    • (1980) AIIE Transactions , vol.12 , pp. 258-262
    • Vickson, R.G.1
  • 25
    • 38149145567 scopus 로고
    • Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
    • Zdrzalka S. Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis. Operations Research Letters 10 (1991) 519-524
    • (1991) Operations Research Letters , vol.10 , pp. 519-524
    • Zdrzalka, S.1


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