메뉴 건너뛰기




Volumn 167, Issue 3, 2005, Pages 739-751

Punctuality and idleness in just-in-time scheduling

Author keywords

Bicriteria scheduling; Deviation; Dynamic programming; Idleness; One machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DYNAMIC PROGRAMMING; FUNCTIONS; OPERATIONS RESEARCH;

EID: 13544272574     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.018     Document Type: Article
Times cited : (11)

References (25)
  • 3
    • 0027542554 scopus 로고
    • Single machine scheduling with early and tardy completion costs
    • J.S. Davis, and J.J. Kanet Single machine scheduling with early and tardy completion costs Naval Research Logistics 40 1993 85 101
    • (1993) Naval Research Logistics , vol.40 , pp. 85-101
    • Davis, J.S.1    Kanet, J.J.2
  • 4
    • 0023542419 scopus 로고
    • Minimizing weighted absolute deviation in single machine scheduling
    • T.D. Fry, R.D. Armstrong, and J.H. Blackstone Minimizing weighted absolute deviation in single machine scheduling IIE Transactions 19 1987 445 450
    • (1987) IIE Transactions , vol.19 , pp. 445-450
    • Fry, T.D.1    Armstrong, R.D.2    Blackstone, J.H.3
  • 5
    • 38249036025 scopus 로고
    • Single machine scheduling: A comparison of two solution procedures
    • T.D. Fry, G. Leong, and T. Rakes Single machine scheduling: A comparison of two solution procedures Omega 15 1987 277 282
    • (1987) Omega , vol.15 , pp. 277-282
    • Fry, T.D.1    Leong, G.2    Rakes, T.3
  • 6
    • 0024010206 scopus 로고
    • One-processor scheduling with symmetric earliness and tardiness penalties
    • M.R. Garey, R.E. Tarjan, and G.T. Wilfong One-processor scheduling with symmetric earliness and tardiness penalties Mathematics of Operations Research 13 1988 330 348
    • (1988) Mathematics of Operations Research , vol.13 , pp. 330-348
    • Garey, M.R.1    Tarjan, R.E.2    Wilfong, G.T.3
  • 7
    • 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. 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.3
  • 8
    • 0026223827 scopus 로고
    • Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
    • N.G. Hall, W. Kubiak, and S.P. Sethi Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date Operations Research 39 1991 847 856
    • (1991) Operations Research , vol.39 , pp. 847-856
    • Hall, N.G.1    Kubiak, W.2    Sethi, S.P.3
  • 9
    • 4744340577 scopus 로고    scopus 로고
    • Machine scheduling with earliness, tardiness and non-execution penalties
    • in press. doi:10.1016/j.ejor.2003.08.012
    • R. Hassin, M. Shani, Machine scheduling with earliness, tardiness and non-execution penalties, Computers & Operations Research, in press. doi:10.1016/j.ejor.2003.08.012
    • Computers & Operations Research
    • Hassin, R.1    Shani, M.2
  • 11
    • 0001399202 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
    • J.A. Hoogeveen, and S.L. van de Velde A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time INFORMS Journal on Computing 8 1996 402 412
    • (1996) INFORMS Journal on Computing , vol.8 , pp. 402-412
    • Hoogeveen, J.A.1    Van De Velde, S.L.2
  • 12
    • 0031268318 scopus 로고    scopus 로고
    • A neighborhood scheme with a compressed solution space, for the early/tardy scheduling problem
    • R. James, and J. Buchanan A neighborhood scheme with a compressed solution space, for the early/tardy scheduling problem European Journal of Operational Research 102 1997 513 527
    • (1997) European Journal of Operational Research , vol.102 , pp. 513-527
    • James, R.1    Buchanan, J.2
  • 13
    • 0028734441 scopus 로고
    • Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
    • Y.D. Kim, and C. Yano Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates Naval Research Logistics 41 1994 913 933
    • (1994) Naval Research Logistics , vol.41 , pp. 913-933
    • Kim, Y.D.1    Yano, C.2
  • 14
    • 0033891465 scopus 로고    scopus 로고
    • Dynamic programming approaches to the multiple criteria knapsack problem
    • K. Klamroth, and M.M. Wiecek Dynamic programming approaches to the multiple criteria knapsack problem Naval Research Logistics 47 2000 57 76
    • (2000) Naval Research Logistics , vol.47 , pp. 57-76
    • Klamroth, K.1    Wiecek, M.M.2
  • 15
    • 0025868004 scopus 로고
    • A note on optimal schedules for mixed-model assembly lines in JIT production systems
    • W. Kubiak, and S.P. Sethi A note on optimal schedules for mixed-model assembly lines in JIT production systems Management Science 37 1991 121 122
    • (1991) Management Science , vol.37 , pp. 121-122
    • Kubiak, W.1    Sethi, S.P.2
  • 17
    • 0001360372 scopus 로고
    • Level schedules for mixed-model assembly lines in just-in-time production systems
    • J.G. Miltenburg Level schedules for mixed-model assembly lines in just-in-time production systems Management Science 35 1989 192 207
    • (1989) Management Science , vol.35 , pp. 192-207
    • Miltenburg, J.G.1
  • 18
    • 0003449926 scopus 로고
    • Industrial Engineering and Management Press Norcross, GA
    • Y. Monden Toyota Production Systems 1983 Industrial Engineering and Management Press Norcross, GA
    • (1983) Toyota Production Systems
    • Monden, Y.1
  • 19
    • 12344252827 scopus 로고    scopus 로고
    • Optimal timing of a sequence of tasks with general completion costs
    • in press. doi:10.1016/j.ejor.2004.01.025
    • F. Sourd, Optimal timing of a sequence of tasks with general completion costs, European Journal of Operational Research, in press. doi:10.1016/j.ejor. 2004.01.025
    • European Journal of Operational Research
    • Sourd, F.1
  • 20
    • 3543096874 scopus 로고    scopus 로고
    • The one machine problem with earliness and tardiness penalties
    • F. Sourd, and S. Kedad-Sidhoum The one machine problem with earliness and tardiness penalties Journal of Scheduling 6 2003 533 549
    • (2003) Journal of Scheduling , vol.6 , pp. 533-549
    • Sourd, F.1    Kedad-Sidhoum, S.2
  • 21
    • 84977334714 scopus 로고
    • Optimal timing schedules in earliness-tardiness single machine sequencing
    • W. Szwarc, and S.K. Mukhopadhyay Optimal timing schedules in earliness-tardiness single machine sequencing Naval Research Logistics 42 1995 1109 1114
    • (1995) Naval Research Logistics , vol.42 , pp. 1109-1114
    • Szwarc, W.1    Mukhopadhyay, S.K.2
  • 23
    • 0037290066 scopus 로고    scopus 로고
    • Single machine scheduling with symmetric earliness and tardiness penalties
    • J.A. Ventura, and S. Radhakrishnan Single machine scheduling with symmetric earliness and tardiness penalties European Journal of Operational Research 144 2003 598 612
    • (2003) European Journal of Operational Research , vol.144 , pp. 598-612
    • Ventura, J.A.1    Radhakrishnan, S.2
  • 24
    • 0032209032 scopus 로고    scopus 로고
    • Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
    • S. Verma, and M. Dessouky Single-machine scheduling of unit-time jobs with earliness and tardiness penalties Mathematics of Operations Research 23 1998 930 943
    • (1998) Mathematics of Operations Research , vol.23 , pp. 930-943
    • Verma, S.1    Dessouky, M.2
  • 25
    • 0037120685 scopus 로고    scopus 로고
    • Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
    • G. Wan, and B.P.C. Yen Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties European Journal of Operational Research 142 2002 271 281
    • (2002) European Journal of Operational Research , vol.142 , pp. 271-281
    • Wan, G.1    Yen, B.P.C.2


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