메뉴 건너뛰기
European Journal of Operational Research
Volumn 187, Issue 3, 2008, Pages 1282-1292
Open-shop batch scheduling with identical jobs
Author keywords

Batch scheduling; Flowtime; Makespan; Open shop
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; PROBLEM SOLVING;
EID: 36849021148     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.068     Document Type: Article
Times cited : (36)
References (11)
  • 1
    • 36849082395 scopus 로고    scopus 로고
    • A. Allahverdi, C.T. Ng, T.C.E. Cheng, M.Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research in press, doi:10.1016/j.ejor.2006.06.060.
  • 2
    • 0346452841 scopus 로고    scopus 로고
    • Scheduling batches with sequential job processing for two-machine flow and open-shops
    • Glass C.A., Potts C.N., and Strusevich V.A. Scheduling batches with sequential job processing for two-machine flow and open-shops. INFORMS Journal of Computing 13 (2001) 120-137
    • (2001) INFORMS Journal of Computing , vol.13 , pp. 120-137
    • Glass, C.A.1    Potts, C.N.2    Strusevich, V.A.3
  • 3
    • 38249004716 scopus 로고
    • Two-machine shop scheduling problems with batch processing
    • Kleinau U. Two-machine shop scheduling problems with batch processing. Mathematical and Computer Modelling 17 (1993) 55-66
    • (1993) Mathematical and Computer Modelling , vol.17 , pp. 55-66
    • Kleinau, U.1
  • 4
    • 0000399511 scopus 로고
    • Computational complexity of discrete optimization problems
    • Lenstra J.K., and Rinnooy Kan A.H.G. Computational complexity of discrete optimization problems. Annals of Discrete Math 4 (1979) 121-140
    • (1979) Annals of Discrete Math , vol.4 , pp. 121-140
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 5
    • 5144221177 scopus 로고    scopus 로고
    • A note on flow-shop batch scheduling with identical processing time jobs
    • Mosheiov G., and Oron D. A note on flow-shop batch scheduling with identical processing time jobs. The European Journal of Operational Research 161 (2005) 285-291
    • (2005) The European Journal of Operational Research , vol.161 , pp. 285-291
    • Mosheiov, G.1    Oron, D.2
  • 6
    • 4444355385 scopus 로고    scopus 로고
    • Flow-shop batch scheduling with identical processing time jobs
    • Mosheiov G., Oron D., and Ritov Y. Flow-shop batch scheduling with identical processing time jobs. Naval Research Logistics 51 (2004) 783-799
    • (2004) Naval Research Logistics , vol.51 , pp. 783-799
    • Mosheiov, G.1    Oron, D.2    Ritov, Y.3
  • 7
    • 19944397854 scopus 로고    scopus 로고
    • Minimizing flowtime on a single machine with integer batch sizes
    • Mosheiov G., Oron D., and Ritov Y. Minimizing flowtime on a single machine with integer batch sizes. Operations Research Letters 33 (2005) 497-501
    • (2005) Operations Research Letters , vol.33 , pp. 497-501
    • Mosheiov, G.1    Oron, D.2    Ritov, Y.3
  • 8
    • 36849015058 scopus 로고    scopus 로고
    • C.T. Ng, M.Y. Kovalyov, Batching and scheduling in multi-machine flow-shop, Working paper, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, 2004.
  • 10
    • 0022132659 scopus 로고
    • Batching single operation manufacturing systems
    • Santos C., and Magazine M. Batching single operation manufacturing systems. Operations Research Letters 4 (1985) 99-103
    • (1985) Operations Research Letters , vol.4 , pp. 99-103
    • Santos, C.1    Magazine, M.2
  • 11
    • 0026860832 scopus 로고
    • A polynomial algorithm for a one machine batching problem
    • Shallcross D.F. A polynomial algorithm for a one machine batching problem. Operations Research Letters 11 (1992) 213-218
    • (1992) Operations Research Letters , vol.11 , pp. 213-218
    • Shallcross, D.F.1

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