Neighborhood Search Heuristic for 2-Machine Flowshop Scheduling Problem with Limited Waiting Times

Abstract:

The flowshop scheduling problem with limited waiting time constraints widely exists in the production process featured by high temperature and continuity. The constraints require that the waiting time of any job between two consecutive machines is not greater than a given upper bound. In this paper, the problem with two-machine settings and the objective of makespan is studied. First, a lower bound and some characters of minimum makespan are analyzed. Further, a solving idea is suggested by a transformation into an asymmetry TSP. Based on these characteristics and the solving idea, a neighborhood search algorithm embedding a modified Lin-Kernighan heuristic is presented for the problem. Numerical results demonstrated the effectiveness and efficiency of the algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 411-414)
• Pages: 1894-1897
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.411-414.1894
• Online since: September 2013
• Authors: Bai Lin Wang, Tie Ke Li, Heng Bo Ge
• Keywords: Flow Shop Scheduling, Limited Waiting Times, Neighborhood Search, Two-Machine FSS

References

[1] Q-K Pan, L Wang, K Mao, ect. IEEE Transactions on Automation Science and Engineering, Vol. 10 (2013), pp.307-322.

[2] A Hodson, A P Muhlemann, D H R Price. Operational Research Society, Vol. 36(1985), pp.903-914.

[3] D L Yang, M S Chern. Computers and Industrial Engineering, Vol. 28(1995), pp.63-70.

[4] B Wang, T Li. Proceedings of 20th ICPR. Shanghai, China (2009).

[5] L H Su. Computers & Industrial Engineering, Vol. 44(2003), pp.409-424.

[6] B J Joo, Y D Kim. Journal of the Operational Research Society, Vol. 60(2009), p.572–582.

[7] K Helsgaun. European Journal of Operational Research, Vol. 126(2000), pp.106-130.