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

ISSN： 0254-5330

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

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

Inverse scheduling: two-machine flow-shop problem

By Brucker Peter

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 239-256

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

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

An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 2, Iss. 1, 2011-01 ,pp. : 29-43

IGI Global_journal

Access to resources Recommend Favorite

Heuristics for scheduling in a flowshop with setup, processing and removal times separated

By Rajendran C. Ziegler H.

Production Planning and Control, Vol. 8, Iss. 6, 1997-09 ,pp. : 568-576

Taylor & Francis Ltd

Access to resources Recommend Favorite