Local search metaheuristics for discrete-continuous scheduling problems

Author： Jozefowska J. Mika M. Rozycki R. Waligora G. Weglarz J.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.107, Iss.2, 1998-06, pp. : 354-370

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

On a methodology for discrete-continuous scheduling

By Jozefowska J. Weglarz J.

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

Elsevier

Access to resources Recommend Favorite

Discrete-continuous scheduling problems - Mean completion time results

By Jozefowska J. Weglarz J.

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 302-309

Elsevier

Access to resources Recommend Favorite

Tabu list management methods for a discrete-continuous scheduling problem

By Jozefowska J. Waligora G. Weglarz J.

European Journal of Operational Research, Vol. 137, Iss. 2, 2002-03 ,pp. : 288-302

Elsevier

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

Eliminating redundant columns in continuous tour scheduling problems

By Brusco M.J. Jacobs L.W.

European Journal of Operational Research, Vol. 111, Iss. 3, 1998-12 ,pp. : 518-525

Elsevier

Access to resources Recommend Favorite