Article Comments

Contributions from readers on our articles are very welcome. This form will let us retrieve the current data in the database and allows us to consider your comments.

Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem
Imed Kacem; Yann Lanuel; Myriam Sahnoune
International Journal of Planning and Scheduling (IJPS), 2011 Vol.1 No.1/2, pp.32 - 41
7 + 20 =

Thank you for your feedback.

Return to top