Makespan minimization for two parallel machines with an unavailable period on each machine

Authors: Lin, Chien-Hung; Liao, Ching-Jong

Source: The International Journal of Advanced Manufacturing Technology, Volume 33, Numbers 9-10, July 2007 , pp. 1024-1030(7)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

Abstract:

In this paper, we consider a two parallel machine problem where each machine has a fixed and known unavailable period. The objective is to minimize the makespan. In the literature, the problem has been considered for the case in which there is only one unavailable period on either one of the machines. This paper extends the results to two unavailable periods, one for each machine. For each of the different cases of the problem, an algorithm is developed to find the optimal solution. Although all the proposed algorithms have exponential time complexities, they are quite efficient in solving large problems. Computational results for problems with up to 1000 jobs are reported.

Keywords: Availability constraints; Makespan; Parallel machines; Scheduling

Document Type: Research Article

DOI: http://dx.doi.org/10.1007/s00170-006-0524-4

Affiliations: Email: lucaslin@jwit.edu.tw

Publication date: July 1, 2007

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page