By Topic

A Column Generation Method for the Parallel-Machine Scheduling Problem with availability constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mellouli, R. ; ICD-OSI (CNRS FRE 2848), Univ. of Technol. de Troyes ; Sadfi, C. ; Chengbin Chu ; Kacem, I.

In this paper, we study the problem of scheduling jobs on identical parallel machines with the objective of minimizing the total completion times of jobs where each machine is subject to one unavailability time interval. We provide a column generation based method to obtain a lower bound for the problem. Computational experiments show the interest and the versatility of the proposed method

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on  (Volume:1 )

Date of Conference:

4-6 Oct. 2006