Scheduling algorithms for flexible flowshops: Worst and average case performance Academic Article

abstract

• We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each part is processed by at most one machine in each center. The problem of finding minimum finish time schedules is considered. Heuristic algorithms are presented and are studied in the worst and average case performance contexts. 1989.

authors

• Sriskandarajah, Chelliah

published proceedings

• European Journal of Operational Research

author list (cited authors)

• Sriskandarajah, C., & Sethi, S. P.

citation count

• 140

complete list of authors

• Sriskandarajah, C||Sethi, SP

publication date

• November 1989

publisher

• Elsevier  Publisher

published in

• European Journal of Operational Research  Journal

keywords

• Flexible Flowshop
• Heuristic Algorithms
• Performance Bounds
• Scheduling
• Worst Case Analysis

Digital Object Identifier (DOI)

• 10.1016/0377-2217(89)90208-7

start page

• 143

end page

• 160

volume

• 43

issue

• 2

URL

• http://dx.doi.org/10.1016/0377-2217(89)90208-7