Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.115, Iss.1-4, 2002-09, pp. : 147-172

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

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

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

Hybrid approach to decision-making for job-shop scheduling

By Mesghouni K. Pesin P. Trentesaux D. Hammadi S. Tahon C. Borne P.

Production Planning and Control, Vol. 10, Iss. 7, 1999-10 ,pp. : 690-706

Taylor & Francis Ltd

Access to resources Recommend Favorite

Job shop scheduling by pheromone approach in a dynamic environment

By Renna P.

International Journal of Computer Integrated Manufacturing, Vol. 23, Iss. 5, 2010-05 ,pp. : 412-424

Taylor & Francis Ltd

Access to resources Recommend Favorite

Lower bounds for on-line single-machine scheduling

By Epstein L. van Stee R.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 439-450

Elsevier

Access to resources Recommend Favorite