Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure

Author： Roslof J. Harjunkoski I. Westerlund T. Isaksson J.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.138, Iss.1, 2002-04, pp. : 29-42

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

The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

By Ahn T. Erenguc S.S.

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 250-259

Elsevier

Access to resources Recommend Favorite

Solving a two-dimensional trim-loss problem with MILP

By Westerlund T. Isaksson J. Harjunkoski I.

European Journal of Operational Research, Vol. 104, Iss. 3, 1998-02 ,pp. : 572-581

Elsevier

Access to resources Recommend Favorite

Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

By Noor-E-Alam Md. Doucette John

Engineering Optimization, Vol. 47, Iss. 8, 2015-08 ,pp. : 1085-1106

Taylor & Francis Ltd

Access to resources Recommend Favorite

A combined transportation and scheduling problem

By Equi L. Gallo G. Marziale S. Weintraub A.

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 94-104

Elsevier

Access to resources Recommend Favorite

Solving large-scale real-world telecommunication problems using a grid-based genetic algorithm

By Luna Francisco Nebro Antonio Alba Enrique Durillo Juan

Engineering Optimization, Vol. 40, Iss. 11, 2008-11 ,pp. : 1067-1084

Taylor & Francis Ltd

Access to resources Recommend Favorite