Tabu list management methods for a discrete-continuous scheduling problem

Author： Jozefowska J. Waligora G. Weglarz J.

Publisher： Elsevier

ISSN： 0377-2217

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

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

Local search metaheuristics for discrete-continuous scheduling problems

By Jozefowska J. Mika M. Rozycki R. Waligora G. Weglarz J.

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

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

A tabu search approach for the flow shop scheduling problem

By Ben-Daya M. Al-Fawzan M.

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 88-95

Elsevier

Access to resources Recommend Favorite

Performance enhancements to tabu search for the early/tardy scheduling problem

By James R.J.W. Buchanan J.T.

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 254-265

Elsevier

Access to resources Recommend Favorite