메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 54, Issue 6, 2003, Pages 661-664
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Author keywords

Bicriteria scheduling; Maximum earliness; Number of tardy jobs
Indexed keywords

ALGORITHMS; POLYNOMIALS; SCHEDULING;
EID: 0037872191     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601478     Document Type: Article
Times cited : (8)
References (10)
  • 1
    • 0001640020 scopus 로고
    • Complexity of single machine hierarchical scheduling: A survey
    • Lee CY and Vairaktarakis GL (1993). Complexity of single machine hierarchical scheduling: a survey. Complex Numer Optim 19: 269-298.
    • (1993) Complex Numer Optim , vol.19 , pp. 269-298
    • Lee, C.Y.1    Vairaktarakis, G.L.2
  • 3
    • 0024010206 scopus 로고
    • One processor scheduling with symmetric earliness and tardiness penalties
    • Garey MR, Tarjan RE and Wilfong GT (1988). One processor scheduling with symmetric earliness and tardiness penalties. Math Opl Res 13: 330-348.
    • (1988) Math Opl Res , vol.13 , pp. 330-348
    • Garey, M.R.1    Tarjan, R.E.2    Wilfong, G.T.3
  • 4
    • 0037694684 scopus 로고    scopus 로고
    • A single machine scheduling model for coordinating logistics activities in simple supply chain
    • Rotterdam School of Management, Erasmus University
    • Hoogeveen JA and van de Velde S (1997). A single machine scheduling model for coordinating logistics activities in simple supply chain. Management Report No 30(13), Rotterdam School of Management, Erasmus University.
    • (1997) Management Report No 30(13) , vol.30 , Issue.13
    • Hoogeveen, J.A.1    Van de Velde, S.2
  • 5
    • 0032000622 scopus 로고    scopus 로고
    • Minimizing flow time and maximum earliness on a single machine
    • Koksalan M, Azizoglu M and Kondakci S (1998). Minimizing flow time and maximum earliness on a single machine. IIE Trans 30: 192-200.
    • (1998) IIE Trans , vol.30 , pp. 192-200
    • Koksalan, M.1    Azizoglu, M.2    Kondakci, S.3
  • 6
    • 0038709135 scopus 로고    scopus 로고
    • Single machine scheduling with two criteria: Maximum earliness and number tardy
    • Department of Industrial Engineering, METU, Ankara
    • Azizoglu M, Kondakci S and Koksalan M (1997). Single machine scheduling with two criteria: maximum earliness and number tardy. Technical Report No: 97-02. Department of Industrial Engineering, METU, Ankara.
    • (1997) Technical Report No: 97-02 , vol.97 , Issue.2
    • Azizoglu, M.1    Kondakci, S.2    Koksalan, M.3
  • 7
    • 0000062028 scopus 로고
    • An n job, one machine sequencing algorithm for minimizing the number of late jobs
    • Moore JM (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Mngl Sci 15: 102-109.
    • (1968) Mngl Sci , vol.15 , pp. 102-109
    • Moore, J.M.1
  • 8
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5: 287-326.
    • (1979) Ann Discrete Math , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 9
    • 0032071138 scopus 로고    scopus 로고
    • Scheduling with finite capacity output buffers
    • Hall N, Posner M and Potts C (1998). Scheduling with finite capacity output buffers. Opns Res 46: 584-597.
    • (1998) Opns Res , vol.46 , pp. 584-597
    • Hall, N.1    Posner, M.2    Potts, C.3
  • 10
    • 0030087378 scopus 로고    scopus 로고
    • Minimizing maximum promptness and maximum lateness on a single machine
    • Hoogeveen JA (1996). Minimizing maximum promptness and maximum lateness on a single machine. Math Opns Res 21: 100-114.
    • (1996) Math Opns Res , vol.21 , pp. 100-114
    • Hoogeveen, J.A.1

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