메뉴 건너뛰기




Volumn 107, Issue 3, 1998, Pages 656-668

A lexicographic approach to bi-objective loading of a flexible assembly system

Author keywords

Flexible manufacturing system; Lexicographic approach; Loading and routing; LP based heuristic; Multiobjective integer programming

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; FACTORY AUTOMATION; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOADING; MATERIALS HANDLING EQUIPMENT; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING; UNLOADING;

EID: 0032095129     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00091-X     Document Type: Article
Times cited : (17)

References (21)
  • 3
    • 0022794511 scopus 로고
    • A branch and bound approach for machine load balancing in flexible manufacturing systems
    • M. Berrada, K.E. Stecke, A branch and bound approach for machine load balancing in flexible manufacturing systems, Management Science 32 (1986) 1316-1335.
    • (1986) Management Science , vol.32 , pp. 1316-1335
    • Berrada, M.1    Stecke, K.E.2
  • 4
    • 0024641634 scopus 로고
    • A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems
    • S. Ghosh, R.J. Gagnon, A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. International Journal of Production Research 27 (1989) 637-670.
    • (1989) International Journal of Production Research , vol.27 , pp. 637-670
    • Ghosh, S.1    Gagnon, R.J.2
  • 6
    • 0028516733 scopus 로고
    • A new branch and bound algorithm for loading problems in flexible manufacturing systems
    • Y.-D. Kim, C.A. Yano, A new branch and bound algorithm for loading problems in flexible manufacturing systems, International Journal of Flexible Manufacturing Systems 6 (1994) 361-382.
    • (1994) International Journal of Flexible Manufacturing Systems , vol.6 , pp. 361-382
    • Kim, Y.-D.1    Yano, C.A.2
  • 10
    • 0000438412 scopus 로고
    • Approximation algorithms for scheduling unrelated parallel machines
    • J. Lenstra, D.B. Shmoys, E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming 46 (1990) 259-271.
    • (1990) Mathematical Programming , vol.46 , pp. 259-271
    • Lenstra, J.1    Shmoys, D.B.2    Tardos, E.3
  • 12
    • 0028377653 scopus 로고
    • A formulation and solution methodology for part movement minimization and workload balancing at loading decisions in FMS
    • B.K. Modi, K. Shanker, A formulation and solution methodology for part movement minimization and workload balancing at loading decisions in FMS, International Journal of Production Economics 34 (1) (1994) 73-82.
    • (1994) International Journal of Production Economics , vol.34 , Issue.1 , pp. 73-82
    • Modi, B.K.1    Shanker, K.2
  • 14
    • 0001935804 scopus 로고
    • Integer programming models for the design and balancing of flexible assembly systems
    • T. Sawik, Integer programming models for the design and balancing of flexible assembly systems, Mathematical and Computer Modelling 21 (4) (1995) 1-12.
    • (1995) Mathematical and Computer Modelling , vol.21 , Issue.4 , pp. 1-12
    • Sawik, T.1
  • 16
    • 0031103340 scopus 로고    scopus 로고
    • An interactive approach to bicriterion loading of a flexible assembly system
    • T. Sawik, An interactive approach to bicriterion loading of a flexible assembly system, Mathematical and Computer Modelling 25 (6) (1997) 71-83.
    • (1997) Mathematical and Computer Modelling , vol.25 , Issue.6 , pp. 71-83
    • Sawik, T.1
  • 19
    • 0022097833 scopus 로고
    • The optimality of unbalancing both workloads and machine group sizes in closed queueing networks of multi-server queues
    • K.E. Stecke, J.J. Solberg, The optimality of unbalancing both workloads and machine group sizes in closed queueing networks of multi-server queues, Operations Research 33 (4) (1985) 882-910.
    • (1985) Operations Research , vol.33 , Issue.4 , pp. 882-910
    • Stecke, K.E.1    Solberg, J.J.2
  • 21
    • 0021202885 scopus 로고
    • An integer programming algorithm with network cuts for solving the assembly line balancing problem
    • F.B. Talbot, J.H. Paterson, An integer programming algorithm with network cuts for solving the assembly line balancing problem, Management Science 30 (1) (1984) 85-99.
    • (1984) Management Science , vol.30 , Issue.1 , pp. 85-99
    • Talbot, F.B.1    Paterson, J.H.2


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