Welcome to the InfoSci Platform
Reference Hub5
An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints

An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints

Fayçal Belkaid, Farouk Yalaoui, Zaki Sari
Copyright: © 2016 |Volume: 9 |Issue: 3 |Pages: 25
ISSN: 1935-5726|EISSN: 1935-5734|EISBN13: 9781466689749|DOI: 10.4018/IJISSCM.2016070101
Cite Article Cite Article

MLA

Belkaid, Fayçal, et al. "An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints." IJISSCM vol.9, no.3 2016: pp.1-25. http://doi.org/10.4018/IJISSCM.2016070101

APA

Belkaid, F., Yalaoui, F., & Sari, Z. (2016). An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints. International Journal of Information Systems and Supply Chain Management (IJISSCM), 9(3), 1-25. http://doi.org/10.4018/IJISSCM.2016070101

Chicago

Belkaid, Fayçal, Farouk Yalaoui, and Zaki Sari. "An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints," International Journal of Information Systems and Supply Chain Management (IJISSCM) 9, no.3: 1-25. http://doi.org/10.4018/IJISSCM.2016070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In present manufacturing environment, the reentrant scheduling problem is one of the most important issues in the planning and operation of production systems. It has a large scope such as capacity distribution and inventory control. On the other hand, the markets are very competitive; it is a critical requirement of operational management to have effective management of resources (consumable and renewable) so as to achieve optimal production plan. This study considers a reentrant parallel machines scheduling problem with consumable resources. Each job consumes several components and must be processed more than once in a stage composed of identical parallel machines. The resources availability, jobs assignment and sequencing at each cycle and are considered and optimized simultaneously. On the basis of this representation, a MILP model is developed. Thus, that MILP model can be used for the problem in order to find the exact solution. Since, this problem is clearly NP-hard, and optimal solutions for large instances are highly intractable, a genetic algorithm is developed to obtain near-optimal solution. Then, an improvement phase based on different local search procedures are performed and examined to generate better solutions. The system performances are assessed in terms of measures such as the solution quality and the execution time. The effectiveness of the proposed metaheuristic is examined based on comparative study. The simulation results demonstrate that the presented algorithm is able to find an optimal solution for small-sized problems and can effectively find a near optimal solution for large-sized problems to minimize the makespan of the considered problem.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.