Climbing discrepancy search for flowshop and jobshop scheduling with time-lags - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Climbing discrepancy search for flowshop and jobshop scheduling with time-lags

Abstract

This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discrepancy Search (CDS). We study various parameter settings. Computational experiments are provided to evaluate the propositions.
Fichier principal
Vignette du fichier
Karoui-Huguet-Lopez-isco2010.pdf (131.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00957670 , version 1 (10-03-2014)

Identifiers

Cite

Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari. Climbing discrepancy search for flowshop and jobshop scheduling with time-lags. ISCO 2010 - International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.821 -- 828, ⟨10.1016/j.endm.2010.05.104⟩. ⟨hal-00957670⟩
104 View
180 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More