Branch and bound-based scheduling of tasks on unrelated parallel multiprocessor systems using Petri nets

Authors:
Abolfazl Jalilvand;Sohrab Khanmohammadi;Fereidoon Shabani Nia
Affiliations:
Faculty of Electrical and Computer Engineering, University of Tabriz, Iran;Faculty of Electrical and Computer Engineering, University of Tabriz, Iran;Faculty of Electrical and Electronics Engineering, Shiraz University, Iran
Venue:
ICC'05 Proceedings of the 9th International Conference on Circuits
Year:
2005

Citing 2
Cited 0

A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System

ICPP '97 Proceedings of the international Conference on Parallel Processing
A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem

ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with scheduling n jobs in an m -machine job-shop environment to minimizes the maximum overall completion time of all jobs called make-span. In this multiprocessor scheduling problem we assume that the jobs are available at time zero and have no sequence- dependent setup times on machines. For solving the scheduling problem we develop a new Branch and bound algorithm which constructs its search tree gradually and doesn't need large size of memory. We will propose a lower bound cost for Branch and bound method. Furthermore for initializing the root node in the search tree a heuristic upper bound cost will be introduced which reduces the branch-and-bound computations. For applying the resultant optimum schedule on the manufacturing system a supervisor Petri net is introduced. The proposed methods will be verified through a computational experiment.