A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.102, Iss.3, 1997-11, pp. : 513-527

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

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

A heuristic for single machine scheduling with early and tardy costs

By Mazzini R. Armentano V.A.

European Journal of Operational Research, Vol. 128, Iss. 1, 2001-01 ,pp. : 129-146

Elsevier

Access to resources Recommend Favorite

The job shop scheduling problem: Conventional and new solution techniques

By Blazewicz J. Domschke W. Pesch E.

European Journal of Operational Research, Vol. 93, Iss. 1, 1996-08 ,pp. : 1-33

Elsevier

Access to resources Recommend Favorite

Using the generalized assignment problem in scheduling the ROSAT space telescope

By Nowakovski J. Schwarzler W. Triesch E.

European Journal of Operational Research, Vol. 112, Iss. 3, 1999-02 ,pp. : 531-541

Elsevier

Access to resources Recommend Favorite

Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs

By Dondeti V.R. Mohanty B.B.

European Journal of Operational Research, Vol. 105, Iss. 3, 1998-03 ,pp. : 509-524

Elsevier

Access to resources Recommend Favorite