Climbing discrepancy search for flowshop and jobshop scheduling with time lags

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.

• Type: Journal
• Year: 2010
• Where: ENDM
• Authors: Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari
• Keywords: Discrepancy Search, ENDM 2010, Maximum Time, Software Engineering, Various Parameter Settings