Minimizing the makespan for the MPM job-shop with availability constraints

N. Zribi, A. El Kamel and P. Borne

International Journal of Production Economics, 2008, vol. 112, issue 1, 151-160

Abstract: In this paper, we deal with the Job-shop with Multi-Purpose Machine scheduling problem with Availability Constraints (JMPMAC). In the first part, we propose a heuristic, based on priority rules to solve the assignment problem. A local search algorithm is then introduced to improve this assignment solution. In the second part, we introduce a genetic algorithm to solve the sequencing problem. Finally, a new lower bound is developed for the problem to evaluate the quality of solutions.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00134-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:112:y:2008:i:1:p:151-160

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().