A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
No-wait hybrid flowshop scheduling: models and solotion algorithms
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī
In this paper hybrid flowshop scheduling problem where some jobs, not all, have to follow no-wait restriction (that is, the operations of that job must be processed with no stop) is examined. In the literature, all papers assume that all jobs of the shops have to follow no-wait restrictions. First, this paper mathematically formulates the problem with two different mixed integer linear models under proposed considerations. The models are evaluated using two performance measures of sizedoi:10.22054/jims.2017.7030 doaj:32e3ed2a2d924dd5bd019a01927adab7 fatcat:y5afr44mxngqlkmorr754nkxvu