A branch and bound based heuristic for multi-product resource constrained scheduling problem in a flexible manufacturing system environment

A branch and bound based heuristic for multi-product resource constrained scheduling problem in a flexible manufacturing system environment

0.00 Avg rating0 Votes
Article ID: iaor20001505
Country: Netherlands
Volume: 113
Issue: 1
Start Page Number: 80
End Page Number: 90
Publication Date: Feb 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: branch and bound, heuristics
Abstract:

This paper addresses an inter-dependent multiple-product resource-constrained sheduling problem with the objective of makespan minimization in a flexible manufacturing system with resource flexibility. Both consumable and non-consumable resources are considered along with their alternative types and constrained utilization rates. A 0–1 integer linear programming formulation is presented for the problem. The complexity of the problem is observed to increase with the availability of alternate resources for product operations. A branch and bound based heuristic is proposed as a solution methodology. A numerical example is presented to illustrate the problem and the effectiveness of the heuristic.

Reviews

Required fields are marked *. Your email address will not be published.