Feng Jin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Feng Jin has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Wu
Department of Automation, Tsinghua University, Beijing, China
2 shared publications - Shiji Song
Tsinghua University
2 shared publications - Jatinder N. D. Gupta
University of Alabama in Huntsville
1 shared publication
Latest Publications
- 4 June 2008
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (6) , 421-432
Makespan distribution of permutation flowshop schedules
- 4 June 2008
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (6) , 421-432
Makespan distribution of permutation flowshop schedules
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 2160133X,p. 1-6
A New Beam Search Algorithm for the Large-Scale Permutation FSP
Beam search algorithm, as an adaptation of branch and bound method, is regarded as one of the effective approaches in solving combinational optimization problems. In this paper, a new beam search algorithm for the large-scale permutation flow shop problem is proposed. A new branching scheme is addressed and compared with the traditional branching scheme. With the new branching scheme, the number of partial schedules in search tree can be greatly reduced. To balance the computational effort and solution quality, partial schedules are evaluated with a new approximate function based on forecast. Numerical experiments show that good solutions of large-scale FSPs could be found in a short time with the proposed algorithm
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 2160133X,p. 1-6
A New Beam Search Algorithm for the Large-Scale Permutation FSP
Beam search algorithm, as an adaptation of branch and bound method, is regarded as one of the effective approaches in solving combinational optimization problems. In this paper, a new beam search algorithm for the large-scale permutation flow shop problem is proposed. A new branching scheme is addressed and compared with the traditional branching scheme. With the new branching scheme, the number of partial schedules in search tree can be greatly reduced. To balance the computational effort and solution quality, partial schedules are evaluated with a new approximate function based on forecast. Numerical experiments show that good solutions of large-scale FSPs could be found in a short time with the proposed algorithm