Abstract:
In this article two mathematical models and lower bounds are presented for the hybrid flow shop scheduling problem noted HFS. We consider m e parallel machines at the fi...View moreMetadata
Abstract:
In this article two mathematical models and lower bounds are presented for the hybrid flow shop scheduling problem noted HFS. We consider m
e
parallel machines at the first stage and two dedicated machines at the second stage. We showed that the performance depends on the choice of the decision variable types.
Date of Conference: 09-12 October 2016
Date Added to IEEE Xplore: 09 February 2017
ISBN Information: