Heuristic algorithms for job-shop scheduling problemswith stochastic precedence constraints

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 45-63

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

Comparative evaluation of genetic algorithms for job-shop scheduling

By Ponnambalam S. G. Aravindan P. Rao P.S.

Production Planning and Control, Vol. 12, Iss. 6, 2001-09 ,pp. : 560-574

Taylor & Francis Ltd

Access to resources Recommend Favorite

Quick value-setting algorithms for the longest path problem of job-shop scheduling

By Hong Choi Shiu Yu Yang Feng

Journal of Manufacturing Technology Management, Vol. 16, Iss. 8, 2005-01 ,pp. : 956-972

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

New Single Machine and Job-Shop Scheduling Problems with Availability Constraints

By Mauguière Ph. Billaut J.-C. Bouquard J.-L.

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 211-231

Springer Publishing Company

Access to resources Recommend Favorite

Shop scheduling problems under precedence constraints

By Strusevich V.A.

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 351-377

Springer Publishing Company

Access to resources Recommend Favorite

Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 8, 2014-08 ,pp. : 733-746

Taylor & Francis Ltd

Access to resources Recommend Favorite