KNOWLEDGEABLE SIMULATED ANNEALING SCHEME FOR THE EARLY TARDY FLOW-SHOP SCHEDULING PROBLEM

The present paper reports on a new approach to applying simulated anne aling to the flow shop scheduling problem with early/tardy costs. This approach incorporates the simulated annealing methodology with proble m-specific knowledge, which is given in a table called the 'Backward-F orward Exchange Priority Table'. Performance of the proposed method is tested on randomly generated problems and is compared to those of two formal simulated annealing schemes. Finally, it is shown that solutio ns obtained by the proposed method are superior to those of formal ann ealing schemes.