Measures of subproblem criticality in decomposition algorithms for shop scheduling

Author： Aytug H.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

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

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

Heuristics for generalized shop scheduling problems based on decomposition

By Kruger K.   Sotskov Y. N.   Werner F.  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

Job shop scheduling with delay-renewable resources: a comparison of decomposition strategies

By Alfieri A.   Brandimarte P.  

International Journal of Production Research, Vol. 35, Iss. 7, 1997-07 ,pp. : 1807-1824

Taylor & Francis Ltd

Access to resources Recommend Favorite

The application of genetic algorithms to lot streaming in a job-shop scheduling problem

By Chan Felix   Wong T. C.   Chan L. Y.  

International Journal of Production Research, Vol. 47, Iss. 12, 2009-01 ,pp. : 3387-3412

Taylor & Francis Ltd

Access to resources Recommend Favorite

Job shop scheduling with a non-regular objective: a comparison of neighbourhood structures based on a sequencing/timing decomposition

By Brandimarte P.   Maiocco M.  

International Journal of Production Research, Vol. 37, Iss. 8, 1999-05 ,pp. : 1697-1715

Taylor & Francis Ltd

Access to resources Recommend Favorite