Abstract:
The algorithm of the 2-Stage flow shop scheduling problem under the no idle constraint has been described in this paper, where transportation time is allocated for carryi...Show MoreMetadata
Abstract:
The algorithm of the 2-Stage flow shop scheduling problem under the no idle constraint has been described in this paper, where transportation time is allocated for carrying the jobs from one machine to another. Our research aims to determine the optimal jobs sequence processing with the shortest makespan possible, reducing the machine idle time to zero and lowering the machine rental cost. A heuristic algorithm is made clear with a numerical example.
Published in: 2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT)
Date of Conference: 06-08 July 2023
Date Added to IEEE Xplore: 23 November 2023
ISBN Information: