AT A BUS BODY ASSEMBLY PLANT A BEAM SEARCH ALGORITH M FOR SCH EDULING
This work proposes an algorithm for scheduling a bus body assembly plant in Bogotá, Colombia. The company is a branch of one of the largest bus and truck body makers in the world. The scheduling task is very difficult because of the many and lengthy idle times that result in workers loss of productivity. The system is modeled as a Flexible Flow Shop framework with “dynamic eligibility constraints as explained later in the document and makespan as the primary objective. The proposed algorithm is a variation of the common Beam Search Algorithm that expands only portions of the problem Search Tree. Lower bounds were taken from previous work in the topic. The algorithm was tested on several real production plans and on a set of problems adapted from the literature. The proposed algorithm found the optimal solution in all the real instances and in most problems from the literature. The computer times were less than one second for all problems.
Flezible Flow Shop Scheduling Beam Search Bus Body Assembly.
Oscar Nunez Juan Carlos Santamaria Gonzalo Mejia
Department of Industrial Engineering, Universidad de los Andes, Edificio Mario Laserna. Carrera 1E N Department of Industrial Engineering, Universidad de los Andes,Edificio Mario Laserna. Carrera 1E No
国际会议
上海
英文
1-5
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）