Preemptive Hybrid Flowshop Scheduling problem of interval orders

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.137, Iss.1, 2002-02, pp. : 37-49

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

Formulation of an IP-Based Model for Reactive Flow-Shop Scheduling Problem Subject to Arrival of New Orders

Advanced Materials Research, Vol. 2015, Iss. 1115, 2015-08 ,pp. : 616-621

Trans Tech Publications

Access to resources Recommend Favorite

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

By Xu Ye Wang Ling Wang Shengyao Liu Min

Engineering Optimization, Vol. 46, Iss. 9, 2014-09 ,pp. : 1269-1283

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving the continuous flow-shop scheduling problem by metaheuristics

By Fink A. Vosz S.

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 400-414

Elsevier

Access to resources Recommend Favorite

A new constructive heuristic for the flowshop scheduling problem

By Koulamas C.

European Journal of Operational Research, Vol. 105, Iss. 1, 1998-02 ,pp. : 66-71

Elsevier

Access to resources Recommend Favorite

Sevast'yanov's algorithm for the flow-shop scheduling problem

By Lourenco H.R.

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 176-189

Elsevier

Access to resources Recommend Favorite