A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Many real life scheduling problems can be formulated as Flexible Job Shop Scheduling Problems (FJSSPs) which simultaneously optimize several conflicting criteria. A typical feature of such problems is their high computational complexity. The purpose of this paper is to provide a review of the techniques, developed to solve multiple objective FJSSPs during the last decade. These techniques could be classified into two groups: approaches with application of mathematical models and heuristicdoi:10.1515/cait-2015-0025 fatcat:aqgxekvzpbd4rf6uoyta655xi4