A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.47, Iss.24, 2009-02, pp. : 6783-6805

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

Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness

By Mousakhani M.

International Journal of Production Research, Vol. 51, Iss. 12, 2013-06 ,pp. : 3476-3487

Taylor & Francis Ltd

Access to resources Recommend Favorite

Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness

By Nishi Tatsushi Hiranaka Yuichiro

International Journal of Production Research, Vol. 51, Iss. 16, 2013-08 ,pp. : 4778-4796

Taylor & Francis Ltd

Access to resources Recommend Favorite

A study on open shop scheduling to minimise total tardiness

By Naderi B.

International Journal of Production Research, Vol. 49, Iss. 15, 2011-08 ,pp. : 4657-4678

Taylor & Francis Ltd

Access to resources Recommend Favorite

Auction-based distributed scheduling in a dynamic job shop environment

By Dewan P. Joshi S.

International Journal of Production Research, Vol. 40, Iss. 5, 2002-03 ,pp. : 1173-1191

Taylor & Francis Ltd

Access to resources Recommend Favorite

Agent-based distributed scheduling for virtual job shops

By Lou P.

International Journal of Production Research, Vol. 48, Iss. 13, 2010-01 ,pp. : 3889-3910

Taylor & Francis Ltd

Access to resources Recommend Favorite