A cutting plane algorithm for the unrelated parallel machine scheduling problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.141, Iss.3, 2002-09, pp. : 515-525

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 column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

By Chen Z.-L. Powell W.B.

European Journal of Operational Research, Vol. 116, Iss. 1, 1999-07 ,pp. : 220-232

Elsevier

Access to resources Recommend Favorite

Parallel Machine Scheduling Problem with a Resumable Availability Constraint

Advanced Materials Research, Vol. 2014, Iss. 1061, 2015-01 ,pp. : 708-711

Trans Tech Publications

Access to resources Recommend Favorite

Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

By T'kindt V. Billaut J.-C. Proust C.

European Journal of Operational Research, Vol. 135, Iss. 1, 2001-11 ,pp. : 42-49

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

By Kravchenko S.A.

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 101-107

Elsevier

Access to resources Recommend Favorite

A memetic algorithm for the total tardiness single machine scheduling problem

By Franca P.M. Mendes A. Moscato P.

European Journal of Operational Research, Vol. 132, Iss. 1, 2001-07 ,pp. : 224-242

Elsevier

Access to resources Recommend Favorite