Main paperA heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
References (15)
An experimental investigation and comparative evaluation of flow-shop scheduling techniques
Ops Res.
(1970)Introduction of Sequencing and Scheduling
(1974)- et al.
A heuristic algorithm for the n job, m machine sequencing problem
Mgmt Sci.
(1970) - et al.
Theory of Scheduling
(1967) An evaluation of flow-shop sequencing heuristics
Mgmt Sci.
(1977)- et al.
Development of M stage decision rule for scheduling ‘n’ jobs through ‘m’ machines
Ops Res.
(1964) A functional heuristic algorithm for the flow-shop scheduling problem
Op. Res. Q.
(1971)
There are more references available in the full text version of this article.
Cited by (2211)
Models and algorithms for the preventive maintenance optimization of railway vehicles
2024, Expert Systems with ApplicationsLong-sighted dispatching rules for manufacturing scheduling problem in Industry 4.0 hybrid approach
2024, Computers and Industrial EngineeringOrder sequencing for a bucket brigade seru in a mass customization environment
2024, International Journal of Production EconomicsJoint scheduling of AGVs and parallel machines in an automated electrode foil production factory
2024, Expert Systems with ApplicationsA simple migrating birds optimization algorithm with two search modes to solve the no-wait job shop problem
2024, Expert Systems with Applications
Copyright © 1983 Published by Elsevier Ltd.