A Neighborhood Search Algorithm for One-machine Scheduling Problem with Time Lags
The one-machine scheduling problem with time lags while minimizing the completion time is NP-hard. The problem typically arises in a manufacturing where the next job has to be carried out in a specific time window after the completion of the immediately proceeding job. Scheduling the jobs is to find a shortest path that passes all the nodes and meets all precedence constraints and time lags constraints on AON (Activity-On-Node) net. A nonlinear mathematic optimization model is established based on AON net. A neighborhood search algorithm is proposed to convert the nonlinear model into a linear programming model that could be solved by standard software. Computational results prove that the proposed neighborhood search algorithm is effective.
One-machine Scheduling Time Lags Neighborhood Search Algorithm and AON Net
Zhao Ruiguo Li Jiejia
LiaoNing Urban Construction School, Shenyang 110015, China College of Information & Control Engineering, Shenyang Institute of Architectural and Civil Engineer
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
1937-1940
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）