A neighborhood search algorithm for one-machine scheduling problem with time lags

Authors:
Zhao Ruiguo;Li Jiejia
Affiliations:
LiaoNing Urban Construction School, Shenyang, China;College of Information & Control Engineering, Shenyang Institute of Architectural and Civil Engineering, Shenyang, China
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 5
Cited 0

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

Proceedings of the third international conference on Graphs and optimization
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research
A memetic algorithm for the job-shop with time-lags

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.