메뉴 건너뛰기




Volumn 189, Issue 3, 2008, Pages 734-745

A bi-objective coordination setup problem in a two-stage production system

Author keywords

Manufacturing systems; Multi objective algorithms; Sequencing; Setup minimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; OPTIMIZATION; PROBLEM SOLVING;

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

References (20)
  • 2
    • 3242724127 scopus 로고    scopus 로고
    • A heuristic approach to batching and scheduling a single machine to minimize setup costs
    • Agnetis A., Alfieri A., and Nicosia G. A heuristic approach to batching and scheduling a single machine to minimize setup costs. Computers and Industrial Engineering 46 (2004) 793-802
    • (2004) Computers and Industrial Engineering , vol.46 , pp. 793-802
    • Agnetis, A.1    Alfieri, A.2    Nicosia, G.3
  • 4
    • 0033114757 scopus 로고    scopus 로고
    • A review of scheduling research involving setup considerations
    • Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. Omega 27 (1999) 219-239
    • (1999) Omega , vol.27 , pp. 219-239
    • Allahverdi, A.1    Gupta, J.N.D.2    Aldowaisan, T.3
  • 5
    • 40849123404 scopus 로고    scopus 로고
    • Detti, P., Meloni, C., Pranzo, M., 2003. Local Search Algorithms for the Minimum Cardinality Dominating Trail Set of a Graph, Technical report RT-DIA-84-2003. Dipartimento di Informatica e Automazione, Università Roma Tre, Roma, Italy.
    • Detti, P., Meloni, C., Pranzo, M., 2003. Local Search Algorithms for the Minimum Cardinality Dominating Trail Set of a Graph, Technical report RT-DIA-84-2003. Dipartimento di Informatica e Automazione, Università Roma Tre, Roma, Italy.
  • 6
    • 40849098507 scopus 로고    scopus 로고
    • Detti, P., Meloni, C., Pranzo, M., 2004. Simple bounds for the minimum cardinality dominating trail set problem, Technical report RT-DIA-87-2004. Dipartimento di Informatica e Automazione, Università Roma Tre, Roma, Italy.
    • Detti, P., Meloni, C., Pranzo, M., 2004. Simple bounds for the minimum cardinality dominating trail set problem, Technical report RT-DIA-87-2004. Dipartimento di Informatica e Automazione, Università Roma Tre, Roma, Italy.
  • 7
    • 36248991867 scopus 로고    scopus 로고
    • Detti, P., Meloni, C., Pranzo, M., in press. Minimizing and balancing setups in a serial production system. International Journal of Production Research.
    • Detti, P., Meloni, C., Pranzo, M., in press. Minimizing and balancing setups in a serial production system. International Journal of Production Research.
  • 11
    • 40849115623 scopus 로고    scopus 로고
    • Exact algorithms for the job sequencing and tool switching problem
    • Laporte G., Salazar J.J., and Semet F. Exact algorithms for the job sequencing and tool switching problem. IIE Transactions 35 (2003) 1-9
    • (2003) IIE Transactions , vol.35 , pp. 1-9
    • Laporte, G.1    Salazar, J.J.2    Semet, F.3
  • 12
    • 0005386585 scopus 로고    scopus 로고
    • Iterated local search
    • Glover F., and Kochenberger G. (Eds), Kluwer Academic Publishers, Norwell, MA
    • Lourenco H.R., Martin O., and Stuetzle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2002), Kluwer Academic Publishers, Norwell, MA 321-353
    • (2002) Handbook of Metaheuristics , pp. 321-353
    • Lourenco, H.R.1    Martin, O.2    Stuetzle, T.3
  • 16
    • 0346093873 scopus 로고    scopus 로고
    • A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time
    • Spina R., Galantucci L.M., and Dassisti M. A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time. Computers and Industrial Engineering 45 (2003) 573-583
    • (2003) Computers and Industrial Engineering , vol.45 , pp. 573-583
    • Spina, R.1    Galantucci, L.M.2    Dassisti, M.3
  • 17
    • 0024070715 scopus 로고
    • Models arising from a flexible manufacturing machine, part I: Minimization of the number of tool switches
    • Tang C.S., and Denardo E.V. Models arising from a flexible manufacturing machine, part I: Minimization of the number of tool switches. Operations Research 36 (1988) 767-777
    • (1988) Operations Research , vol.36 , pp. 767-777
    • Tang, C.S.1    Denardo, E.V.2
  • 19
    • 36248974194 scopus 로고    scopus 로고
    • Parts loading scheduling in a flexible forging machine using an advanced genetic algorithm
    • Tsujimura Y., and Gen M. Parts loading scheduling in a flexible forging machine using an advanced genetic algorithm. Journal of Intelligent Manufacturing 12 3 (1999) 413-420
    • (1999) Journal of Intelligent Manufacturing , vol.12 , Issue.3 , pp. 413-420
    • Tsujimura, Y.1    Gen, M.2


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