A bilinear programming model and a modified branch-and-bound algorithm for production planning in steel rolling mills with substitutable demand

Author： As'ad Rami Demirli Kudret

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.49, Iss.12, 2011-06, pp. : 3731-3749

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 branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning

By Wang Shijin Liu Ming

International Journal of Production Research, Vol. 51, Iss. 3, 2013-02 ,pp. : 847-868

Taylor & Francis Ltd

Access to resources Recommend Favorite

A competitive branch-and-bound algorithm for the simple assembly line balancing problem

By Sprecher A.

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1787-1816

Taylor & Francis Ltd

Access to resources Recommend Favorite

Disassembly sequence plan generation using a branch-and-bound algorithm

By Güngör A. Gupta S. M.

International Journal of Production Research, Vol. 39, Iss. 3, 2001-02 ,pp. : 481-509

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the integer programming formulation of production scheduling optimisation algorithm for the hot rolling processes

By Alidaee Bahram

International Journal of Production Research, Vol. 50, Iss. 20, 2012-10 ,pp. : 6036-6039

Taylor & Francis Ltd

Access to resources Recommend Favorite

A mathematical programming model for production planning using CONWIP

By Zhang W. Chen M.

International Journal of Production Research, Vol. 39, Iss. 12, 2001-08 ,pp. : 2723-2734

Taylor & Francis Ltd

Access to resources Recommend Favorite