Author： Azizoglu M. Cakmak E. Kondakci S.
Publisher： Elsevier
ISSN： 0377-2217
Source： European Journal of Operational Research, Vol.132, Iss.3, 2001-08, pp. : 528-538
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Solving the continuous flow-shop scheduling problem by metaheuristics
European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. :
Sevast'yanov's algorithm for the flow-shop scheduling problem
European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. :
Two-machine flow-shop scheduling to minimize total late work
By Lin B.
Engineering Optimization, Vol. 38, Iss. 4, 2006-06 ,pp. :
A fast tabu search algorithm for the permutation flow-shop problem
European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. :