Approximative procedures for no-wait job shop scheduling

By Schuster C.J.   Framinan J.M.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 308-318

Elsevier

Access to resources Recommend Favorite

Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets

By Callegati F.   Cerroni W.   Corazza G.   Develder C.   Pickavet M.   Demeester P.  

Photonic Network Communications, Vol. 8, Iss. 2, 2004-09 ,pp. : 163-176

Springer Publishing Company

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

Approximation algorithms for two-machine flow shop scheduling with batch setup times

By Chen B.   Potts C.N.   Strusevich V.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 255-271

Elsevier

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