Mesgarpour,M.Kirkavak,N.Ozaktas,H.2024-07-052024-07-0520103642121381978-364212138-80302-974310.1007/978-3-642-12139-5_152-s2.0-77952299339https://doi.org/10.1007/978-3-642-12139-5_15https://hdl.handle.net/20.500.14411/3619Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. The trade-offs involved in considering several different criteria provide useful insights for the decision maker. Surprisingly, research in the field of multi-objective scheduling has been quite limited when compared to research in single criterion scheduling. The subject of this paper is the bicriteria scheduling problem in a two-machine flowshop. The objective is to find a job sequence that minimizes sum of weighted total flowtime and total tardiness. Based on the problem characteristics, a Simulated Annealing algorithm is developed. The proposed metaheuristic is compared with the branch and bound enumeration algorithm of the integer programming model as well as a modified version of the well-known NEH algorithm. During these evaluations, the experimental design approach and careful statistical analysis have been used to validate the effectiveness of the simulated annealing approach. © 2010 Springer-Verlag Berlin Heidelberg.eninfo:eu-repo/semantics/closedAccessBicriteria SchedulingFlowshop SchedulingSimulated AnnealingConference Object6022 LNCS1661774