The convergence of stochastic algorithms solving flow shop scheduling

Steinhofel, Kathleen and Albrecht, Andreas A. and Wong, C. K. (2002) The convergence of stochastic algorithms solving flow shop scheduling. Theoretical Computer Science, 285 (1). pp. 101-117. ISSN 0304-3975

Full text is not in this repository.

This item is available in: Library Catalogue

Abstract

In the paper, we apply logarithmic cooling schedules of simulated annealing-based algorithms to flow shop scheduling. In our problem setting, the objective to minimize the overall completion time which is called the makespan. We prove a lower bound for the number of steps that are sufficient to approach an optimum solution with a certain probability. The result is related to the maximum escape depth Γ from local minima of the underlying energy landscape. In our approach, we need View the MathML source steps to be in an optimum solution with probability 1−δ, where n denotes the total number of tasks. The auxiliary computations are of polynomial complexity. Since the model cannot be approximated arbitrarily closely in the general case (unless View the MathML source), the approach can be used to obtain approximation algorithms that work well in the average case.

Item Type: Article
Keywords (uncontrolled): Flow shop scheduling; simulated annealing; logarithmic cooling schedule; convergence
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 12404
Useful Links:
Depositing User: Andreas Albrecht
Date Deposited: 12 Nov 2013 04:49
Last Modified: 13 Oct 2016 14:29
URI: http://eprints.mdx.ac.uk/id/eprint/12404

Actions (login required)

Edit Item Edit Item