会议专题

A Hyper-Heuristic to Sequencing Mixed-models on Assembly-lines Minimizing Work Overload

There are different approaches for the mixed-model assembly-lines sequencing problem. In this paper the goal of minimizing work overload is treated. This approach considers the existence of time windows in each work station. Different versions of a product are considered to be assembled in the line (e.g. car industry), which require different processing time according to the work required in each work station. Long sequences of rich-work products can lead to produce work overload when stations cannot fulfil all the assigned tasks. Since solve this problem optimally is difficult, we test local search and a hyperheuristic procedure. A computational experiment is used to detect the performance of the proposed procedures.

Hyper-heuristic Scheduling Work Overload Local Search Priority Rules

Joaquín BAUTISTA Jaime CANO

NISSAN Chair,ETSEIB,Universitat Politècnica de Catalunya,Spain DEIO,Universitat Politècnica de Catalunya,Spain

国际会议

工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

北京

英文

2007-05-30(万方平台首次上网日期,不代表论文的发表时间)