Volume 4 - Volume 4
SEQUENCING OF TASKS WITH SETUP TIMES USING BRANCH AND BOUND
Abstract
This paper proposes lower bound to be used in the tree search procedure for solving production
scheduling with setup times flowshop environment in order to minimize the total execution time of
tasks limiting. The sequencing problem is to define the best sequence according to predetermined
criteria of optimality, where N tasks must be developed in M machines. In this work, a formulation
for the calculation of the lower being used in the search tree branch and bound bound is proposed
to solve the problem of task sequencing considering N tasks and M machines, involving setup times.
The search algorithm on the tree branch and bound was implemented in Pascal. The recurrence
relations proposals have led to obtaining the minimum sequence. This work was detailed for 4 jobs
and 2 machines.
Paper Details
PaperID: p 1062-1075
Author's Name: Edilson de Jesus and Maria Teresa Rodrigues
Volume: Volume 4
Issues: Volume 4
Keywords: Flowshop, setup times, branch and bound, optimization.
Year: 2014
Month: September
Pages: 1062-1075