An effective heuristic for flow shop problems with total flow time as criterion-Reference-Cited by-同舟云学术

An effective heuristic for flow shop problems with total flow time as criterion

Published:1993-09 Issue:1-4 Volume:25 Page:219-222
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Vempati Venkateswara S.,Chen Chuen-Lung,Bullington Stanley F.

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference12 articles.

1. Introduction of Sequencing and Scheduling;Baker,1974

2. Genetic Algorithms and Job shop Scheduling;Biegal;Computers and Industrial Engineering,1990

3. Bowden, R.O. Jr. “Genetic Algorithm Based Machine Learning Applied to the Dynamic Routing of Discrete Parts,” Doctoral Dissertation, Department of Industrial Engineering, Mississippi State University.

4. Chen, C.L., Vempti S.V., and Aljaber N., “An Application of Genetic Algorithms for Flow Shop Problems” submitted to European Journal of Operational Research.

5. Using Genetic Algorithms to Schedule Flow Shop Releases;Cleveland,1989

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time;International Journal of Bio-Inspired Computation;2016

2. A Novel Variant of QGA with VNS for Flowshop Scheduling Problem;Journal of Computers;2014-09-01

3. An estimation of distribution algorithm (EDA) variant with QGA for Flowshop scheduling problem;SPIE Proceedings;2014-04-16

4. A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem;IEEE Transactions on Evolutionary Computation;2014-04

5. Local search methods for the flowshop scheduling problem with flowtime minimization;European Journal of Operational Research;2012-10