By Topic

Multiresource Shop Scheduling With Resource Flexibility and Blocking

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

2 Author(s)
Mati, Y. ; Coll. of Bus. & Econ., Al-Qassim Univ., Buraidah, Saudi Arabia ; Xiaolan Xie

This paper proposes a general scheduling model that extends job-shop scheduling models to incorporate important features of real manufacturing systems. More precisely, each operation can be performed in different modes and requires a different set of resources depending on the mode. Further, we consider blocking constraints that requires to hold resources used for an operation till resources needed for the next operation of the same job are available. A shortest path approach extending the classical geometric approach is proposed for the two-job case. A greedy heuristic is then proposed to schedule N jobs by considering jobs sequentially, grouping scheduled jobs into a combined job and then scheduling it and the next unscheduled job using the shortest path approach. A metaheuristic is then used to identify effective job sequences. Extensive numerical experimentation proves the efficiency of our approach.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:8 ,  Issue: 1 )