The job shop scheduling problem: Conventional and new solution techniques

Author： Blazewicz J. Domschke W. Pesch E.

Publisher： Elsevier

ISSN： 0377-2217

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

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

Some new results on simulated annealing applied to the job shop scheduling problem

By Kolonko M.

European Journal of Operational Research, Vol. 113, Iss. 1, 1999-02 ,pp. : 123-136

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

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G. Strusevich V.A.

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite

Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem

By Rivera Daniel Cortés Becerra Ricardo Landa Coello Carlos A. Coello

Engineering Optimization, Vol. 39, Iss. 1, 2007-01 ,pp. : 69-85

Taylor & Francis Ltd

Access to resources Recommend Favorite

Two simulated annealing-based heuristics for the job shop scheduling problem

By Steinhofel K. Albrecht A. Wong C.K.

European Journal of Operational Research, Vol. 118, Iss. 3, 1999-11 ,pp. : 524-548

Elsevier

Access to resources Recommend Favorite