Heuristics for generalized shop scheduling problems based on decomposition

Author： Kruger K.   Sotskov Y. N.   Werner F.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.36, Iss.11, 1998-11, pp. : 3013-3033

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

Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

By Uzsoy R.   Wang C-S.  

International Journal of Production Research, Vol. 38, Iss. 6, 2000-04 ,pp. : 1271-1286

Taylor & Francis Ltd

Access to resources Recommend Favorite

A genetic algorithm based procedure for more realistic job shop scheduling problems

By Candido M. A. B.   Khator S. K.   Barcia R. M.  

International Journal of Production Research, Vol. 36, Iss. 12, 1998-12 ,pp. : 3437-3457

Taylor & Francis Ltd

Access to resources Recommend Favorite

Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment

By Aldakhilallah K. A.   Ramesh R.  

International Journal of Production Research, Vol. 39, Iss. 12, 2001-08 ,pp. : 2635-2657

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling job shop associated with multiple routings with genetic and ant colony heuristics

By Girish B. S.   Jawahar N.  

International Journal of Production Research, Vol. 47, Iss. 14, 2009-01 ,pp. : 3891-3917

Taylor & Francis Ltd

Access to resources Recommend Favorite

Measures of subproblem criticality in decomposition algorithms for shop scheduling

By Aytug H.  

International Journal of Production Research, Vol. 41, Iss. 5, 2003-01 ,pp. : 865-882

Taylor & Francis Ltd

Access to resources Recommend Favorite