http://publicationslist.org/data/imed.kacem/atom.xml IMED KACEMhttp://publicationslist.org/imed.kacem$basepathfavicon.icoRecent additions to IMED KACEM's PublicationsList.org pagehttp://publicationslist.org/publications.png2007-11-06T09:23:35Z http://publicationslist.org/imed.kacem/refid1 2007-11-06T09:15:20Z

In this article, we consider a single-machine scheduling problem with one unavailability period, with the aim of minimizing the weighted sum of the completion times. We propose three exact methods for solving such a problem: a branch-and-bound method based on new properties and lower bounds, a mixed integer programming model, and a dynamic programming method. These methods were coded and tested on...<br/><br/>Imed Kacem, Chengbin Chu, Ahmed Souissi (2008) <i>Computers & Operations Research</i> 35: 3 827-844 <br/>

http://publicationslist.org/imed.kacem/refid2 2007-11-06T09:09:13Z

In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the weighted sum of completion times. No polynomial 2-approximation algorithm for this problem has been previously known. We propose a 2-approximation algorithm with O(n2) time complexity where n is the number of jobs. We show that this bound is ti...<br/><br/>Imed Kacem (2007) <i>Computers & Industrial Engineering</i> : <br/>

http://publicationslist.org/imed.kacem/refid4 2007-11-06T09:16:36Z

In this article, we consider the single-machine scheduling problem with one availability constraint. We aim to minimize the weighted sum of completion times. We propose a branch-and-bound algorithm based on a set of improved lower bounds and heuristics. The numerical experiments show the effectiveness of the proposed method. The improved algorithm is able to solve instances of 6000 jobs in a reaso...<br/><br/>Imed Kacem, Chengbin Chu (2007) <i>International Journal of Production Economics </i> : <br/>

http://publicationslist.org/imed.kacem/refid5 2007-11-06T09:22:57Z

In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the makespan when every job has a positive tail. We propose a polynomial approximation algorithm with a worst-case performance ratio of 3/2 for this problem. We show that this bound is tight. We present a dynamic programming algorithm and we show t...<br/><br/>Imed Kacem (2007) <i>Journal of Combinatorial Optimization</i> : <br/>

http://publicationslist.org/imed.kacem/refid3 2007-11-06T09:15:34Z

In this article, we consider the single machine scheduling problem with one planned setup period, with the aim of minimizing the weighted sum of the completion times. We study the WSPT and MWSPT heuristics and we show that the worst-case performance ratio is 3 for the two heuristics in some cases and it is unbounded otherwise. We also show that these worst-case performance ratios are tight. <br/><br/>Imed Kacem, Chengbin Chu (2006) <i>European Journal of Operational Research </i> : <br/>