메뉴 건너뛰기




Volumn 45, Issue 2 SPEC., 2003, Pages 257-268

Single machine scheduling with maximum earliness and number tardy

Author keywords

Bicriteria; Scheduling; Single machine

Indexed keywords

COMPUTER APPLICATIONS; CUSTOMER SATISFACTION; PROBLEM SOLVING; SCHEDULING;

EID: 0038789163     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(03)00034-2     Document Type: Conference Paper
Times cited : (24)

References (14)
  • 1
    • 0023977809 scopus 로고
    • Single machine scheduling to minimize weighted earliness subject to no tardy jobs
    • Chand S., Schneeberger H. Single machine scheduling to minimize weighted earliness subject to no tardy jobs. European Journal of Operational Research. 34:1988;221-230.
    • (1988) European Journal of Operational Research , vol.34 , pp. 221-230
    • Chand, S.1    Schneeberger, H.2
  • 2
    • 0027886805 scopus 로고
    • Simultaneous optimization of efficiency and performance balance measures in single machine scheduling problems
    • Federgruen A., Mosheiov G. Simultaneous optimization of efficiency and performance balance measures in single machine scheduling problems. Naval Research Logistics. 40:1993;951-970.
    • (1993) Naval Research Logistics , vol.40 , pp. 951-970
    • Federgruen, A.1    Mosheiov, G.2
  • 5
    • 0344183121 scopus 로고    scopus 로고
    • A heuristic approach to bicriteria scheduling
    • Köksalan M. A heuristic approach to bicriteria scheduling. Naval Research Logistics. 46:1999;777-789.
    • (1999) Naval Research Logistics , vol.46 , pp. 777-789
    • Köksalan, M.1
  • 6
    • 0032000622 scopus 로고    scopus 로고
    • Minimizing flow time and maximum earliness on a single machine
    • Köksalan M., Azizoglu M., Kondakci S. Minimizing flow time and maximum earliness on a single machine. IIE Transactions. 30:1998;192-200.
    • (1998) IIE Transactions , vol.30 , pp. 192-200
    • Köksalan, M.1    Azizoglu, M.2    Kondakci, S.3
  • 8
    • 0030244408 scopus 로고    scopus 로고
    • Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
    • Kondakci S., Azizoglu M., Köksalan M. Note: Bicriteria scheduling for minimizing flow time and maximum tardiness. Naval Research Logistics. 43:1996;929-936.
    • (1996) Naval Research Logistics , vol.43 , pp. 929-936
    • Kondakci, S.1    Azizoglu, M.2    Köksalan, M.3
  • 9
    • 0030212987 scopus 로고    scopus 로고
    • Single machine scheduling to minimize the number of early and tardy jobs
    • Lann A., Mosheiov G. Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research. 23:1996;769-781.
    • (1996) Computers and Operations Research , vol.23 , pp. 769-781
    • Lann, A.1    Mosheiov, G.2
  • 12
    • 0000062028 scopus 로고
    • An n job one machine sequencing algorithm for minimizing the number of late jobs
    • Moore J.M. An n job one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15:1968;102-109.
    • (1968) Management Science , vol.15 , pp. 102-109
    • Moore, J.M.1
  • 13
    • 0031076052 scopus 로고    scopus 로고
    • Single machine scheduling to minimize weighted earliness subject to maximum tardiness
    • Tsiushuang C., Xiangtong Q., Fengsheng T. Single machine scheduling to minimize weighted earliness subject to maximum tardiness. Computers and Operations Research. 24:1997;147-152.
    • (1997) Computers and Operations Research , vol.24 , pp. 147-152
    • Tsiushuang, C.1    Xiangtong, Q.2    Fengsheng, T.3


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