메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 62, Issue 1, 2011, Pages 238-241
A note: A due-window assignment problem on parallel identical machines
Author keywords

assignment problem; cheduling; due window; earliness tardiness; parallel machines
Indexed keywords

OPERATIONS RESEARCH; RESEARCH;
EID: 78649946412     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.179     Document Type: Article
Times cited : (9)
References (10)
  • 1
    • 0037118177 scopus 로고    scopus 로고
    • A survey of the state-of-theart of common due-date assignment and scheduling research
    • Gordon V, Proth JM and Chu C (2002). A survey of the state-of-theart of common due-date assignment and scheduling research. Eur J Opl Res 135:1-25.
    • (2002) Eur. J. Opl. Res. , vol.135 , pp. 1-25
    • Gordon, V.1    Proth, J.M.2    Chu, C.3
  • 2
    • 0026223840 scopus 로고
    • Earliness-tardiness scheduling problems. I: Weighted deviation of completion times about a common due date
    • Hall NG and Posner ME (1991). Earliness-tardiness scheduling problems. I: Weighted deviation of completion times about a common due date. Opl Res 39:836-846.
    • (1991) Opl Res. , vol.39 , pp. 836-846
    • Hall, N.G.1    Posner, M.E.2
  • 3
    • 34548272651 scopus 로고    scopus 로고
    • Soft due window assignment and scheduling on parallel machines
    • Janiak A, Kovalyov MY and Marek M (2007). Soft due window assignment and scheduling on parallel machines. IEEE T Syst Man Cyb, A 37:614-620.
    • (2007) IEEE T Syst Man Cyb, A , vol.37 , pp. 614-620
    • Janiak, A.1    Kovalyov, M.Y.2    Marek, M.3
  • 4
    • 44449101180 scopus 로고    scopus 로고
    • A single processor scheduling problem with a common due window assignment
    • Fleuren H, den Hertog D and Kort P eds
    • Janiak A and Winczaszek M (2004). A single processor scheduling problem with a common due window assignment. In: Fleuren H, den Hertog D and Kort P (eds), Operations Research Proceedings, pp 213-220.
    • (2004) Operations Research Proceedings , pp. 213-220
    • Janiak, A.1    Winczaszek, M.2
  • 5
    • 33745778024 scopus 로고    scopus 로고
    • Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions
    • Janiak A and Winczaszek M (2006). Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions. Lect Notes Comput Sci 3911:132-139.
    • (2006) Lect Notes Comput Sci. , vol.3911 , pp. 132-139
    • Janiak, A.1    Winczaszek, M.2
  • 6
    • 0030212471 scopus 로고    scopus 로고
    • Determination of common due window location in a single machine scheduling problem
    • Liman SD, Panwalkar SS and Thongmee S (1996). Determination of common due window location in a single machine scheduling problem. Eur J Opl Res 93:68-74.
    • (1996) Eur. J. Opl. Res. , vol.93 , pp. 68-74
    • Liman, S.D.1    Panwalkar, S.S.2    Thongmee, S.3
  • 7
    • 0032167289 scopus 로고    scopus 로고
    • Common due window size and location determination in a single machine scheduling problem
    • Liman SD, Panwalkar SS and Thongmee S (1998). Common due window size and location determination in a single machine scheduling problem. J Opl Res Soc 49:1007-1010.
    • (1998) J. Opl Res. Soc. , vol.49 , pp. 1007-1010
    • Liman, S.D.1    Panwalkar, S.S.2    Thongmee, S.3
  • 8
    • 6344261626 scopus 로고    scopus 로고
    • Due-window assignment with unit processing-time jobs
    • Mosheiov G and Oron D (2004). Due-window assignment with unit processing-time jobs. Nav Res Log 51:1005-1017.
    • (2004) Nav Res. Log , vol.51 , pp. 1005-1017
    • Mosheiov, G.1    Oron, D.2
  • 9
    • 33644682650 scopus 로고    scopus 로고
    • Minimizing weighted earlinesstardiness and due-date cost with unit processing-time jobs
    • Mosheiov G and Yovel U (2006). Minimizing weighted earlinesstardiness and due-date cost with unit processing-time jobs. Eur J Opl Res 172:528-544.
    • (2006) Eur. J. Opl. Res. , vol.172 , pp. 528-544
    • Mosheiov, G.1    Yovel, U.2
  • 10
    • 0000041767 scopus 로고    scopus 로고
    • A note on 'common due-window scheduling'
    • Weng MX and Ventura JA (1996). A note on 'common due-window scheduling'. Prod Opl Mngt 5:194-200.
    • (1996) Prod Opl Mngt. , vol.5 , pp. 194-200
    • Weng, M.X.1    Ventura, J.A.2

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