Approximability of two-machine no-wait flowshop scheduling with availability constraints

By Cheng T.C.E.   Liu Z.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 319-322

Elsevier

Access to resources Recommend Favorite

Solving job shop scheduling problems utilizing the properties of backbone and “big valley”

By Pardalos Panos   Shylo Oleg   Vazacopoulos Alkis  

Computational Optimization and Applications, Vol. 47, Iss. 1, 2010-09 ,pp. : 61-76

Springer Publishing Company

Access to resources Recommend Favorite

Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing

By Bertsimas D.   Gamarnik D.  

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 296-318

Academic Press

Access to resources Recommend Favorite

A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization

By Zhang Rui   Wu Cheng  

IMA Journal of Management Mathematics, Vol. 24, Iss. 1, 2013-01 ,pp. : 111-134

Oxford University Press

Access to resources Recommend Favorite

Approximability of flow shop scheduling

By Hall L.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 175-190

Elsevier

Access to resources Recommend Favorite