2004 journal article

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 155(2), 380–401.

By: B. Wardono n & Y. Fathi n

author keywords: flowshop scheduling; parallel machines; buffer constraints; minimizing makespan
TL;DR: A tabu search algorithm is developed for the problem of scheduling N jobs on parallel machines in L successive stages with limited buffer capacities between stages, and a procedure to construct a complete schedule associated with every permutation vector is proposed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.