A splitting-up approach to simplify job-shop scheduling problems, International Journal of Production Research, vol.14, issue.2, pp.30-34, 1992. ,
DOI : 10.1002/asm.3150070405
How to keep good schemata using cross-over operators for permutation problems, International Transactions in Operational Research, vol.1, issue.4, pp.637-651, 2000. ,
DOI : 10.1111/j.1475-3995.2000.tb00222.x
URL : https://hal.archives-ouvertes.fr/inria-00098871
Negotiation-based collaborative planning between supply chains partners, European Journal of Operational Research, vol.163, issue.3, pp.668-687, 2005. ,
DOI : 10.1016/j.ejor.2004.01.014
Genetic Algorithms in Search, Optimization and Machine Learning, 1989. ,
An improved earliness???tardiness timing algorithm, Computers & Operations Research, vol.34, issue.10, 2006. ,
DOI : 10.1016/j.cor.2005.11.004
URL : https://hal.archives-ouvertes.fr/hal-01185216
Scheduling with target start times, European Journal of Operational Research, vol.129, issue.1, pp.87-94, 2001. ,
DOI : 10.1016/S0377-2217(99)00426-9
Planning tools for managing the supply chain, Computers & Industrial Engineering, vol.46, issue.4, pp.763-779, 2004. ,
DOI : 10.1016/j.cie.2004.05.018
A model for co-operative planning within a virtual enterprise, International journal of Computer Integrated Manufacturing, pp.19-22, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00099823
Méthodes de décompositions spatiales et temporelles en ordonnancement de la production. RAIRO-APII, pp.22-27, 1988. ,
Performances' study on crossover operators keeping good schemata for some scheduling problems, Proceedings of GECCO'2000, pp.331-338, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00099090
Punctuality and idleness in just-in-time scheduling, European Journal of Operational Research, vol.167, issue.3, pp.167-170, 2005. ,
DOI : 10.1016/j.ejor.2004.07.018
URL : https://hal.archives-ouvertes.fr/hal-01185225