Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.83, Iss.1, 1998-01, pp. : 95-114

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A permutation flow-shop scheduling problem with convex models of operation processing times

By Cheng T.C.E. Janiak A.

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 39-60

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups

By Mohammadi Mohammad

International Journal of Computer Integrated Manufacturing, Vol. 24, Iss. 1, 2011-01 ,pp. : 87-93

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Note on Permutation Flow Shop Problem: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Sviridenko M.I.

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 247-252

Springer Publishing Company

Access to resources Recommend Favorite

Permutation flow-shop scheduling using a hybrid differential evolution algorithm

By Wang Hai-yan Lu Ye-bo Peng Wen-li

International Journal of Computing Science and Mathematics, Vol. 4, Iss. 3, 2013-10 ,pp. : 298-307

Inderscience Publishers

Access to resources Recommend Favorite