A Sequencing Problem for Mixed-Model Assembly Line with the Aid of Relief-Man(<Special Issue>Advanced Production Scheduling) A Sequencing Problem for Mixed-Model Assembly Line with the Aid of Relief-Man

Access this Article

Search this Article

Author(s)

Abstract

・rights:日本機械学会・rights:本文データは学協会の許諾に基づきCiNiiから複製したものである・relation:isVersionOf:http://ci.nii.ac.jp/naid/110004820858/

There usually exist large variations in assembly times at mixed-model assembly lines depending on difference of product-models. To increase efficiency of line handling under such circumstance, this paper concerns with a sequencing problem for the mixed-model assembly lines where each product is supposed to be assembled within the same cycle time. Then, we formulate a new type of the sequencing problem minimizing the weighted sum of the line stoppage times and the idle times, and propose a new sequencing method with the aid of Relief Man (<i>RM</i>). Since the resulting problem refers to a combinational optimization problem, we develop a hybrid method that applies meta-heuristics like SA (Simulated Annealing) together with TS (Tabu Search) in a hierarchical manner. Finally, we examine the effectiveness of the proposed method through computer simulations and show the advantage of using <i>RM</i> against various changes in production environment.

Journal

  • JSME International Journal Series C

    JSME International Journal Series C 48(1), 15-20, 2005-03-01

    The Japan Society of Mechanical Engineers

References:  8

Codes

  • NII Article ID (NAID)
    110004820858
  • NII NACSIS-CAT ID (NCID)
    AA11179487
  • Text Lang
    ENG
  • Article Type
    ART
  • ISSN
    13447653
  • NDL Article ID
    7281422
  • NDL Source Classification
    ZN11(科学技術--機械工学・工業)
  • NDL Call No.
    Z53-Y272
  • Data Source
    CJP  NDL  NII-ELS  IR  J-STAGE 
Page Top