Article navigation

The no‐intermediate storage flowshop scheduling problem is investigated. Six algorithms for solving this problem are developed and evaluated in terms of the quality and efficiency of the solutions they produce. Comparative test results from the application of these scheduling algorithms are statistically analysed and discussed.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close subscription notice
Close access options