Inscrição na biblioteca: Guest
Portal Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa
Hybrid Methods in Engineering

ISSN Imprimir: 1099-2391
ISSN On-line: 2641-7359

Archives: Volume 1, 1999 to Volume 4, 2002

Hybrid Methods in Engineering

DOI: 10.1615/HybMethEng.v3.i1.60
13 pages

SOLVING FLEXIBLE FLOW SHOP PROBLEMS BY COMBINING LPT AND GUPTA SCHEDULING ALGORITHMS

Tzung-Pei Hong
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R. O. C.
Chan-Lon Wang
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R.O.C.
Shyue-Liang Wang
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R.O.C.

RESUMO

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow shop problem. Flexible flow shops can thus be thought of as generalizations of simple flow shops. In the past, Sriskandarajah and Sethi [6] proposed a heuristic algorithm for solving flexible flow shop problems for two machine centers. In this article, we extend their algorithm to solve flexible flow shop problems for more than two machine centers. The heuristic Gupta algorithm is adopted as the kernel for achieving this purpose. Because this problem is a nondeterministic-polynomial (NP)-complete problem, optimal solutions seem unnecessary, especially when the number of jobs is large.


Articles with similar content:

Adaptive Extraproximal Algorithm for the Equilibrium Problem in the Hadamard Spaces
Journal of Automation and Information Sciences, Vol.52, 2020, issue 8
Lyubov M. Chabak , Vladimir V. Semenov, Yana I. Vedel , Ekaterina N. Golubeva
Methods of Solving the Problems of Mathematical Safe on Elementary Graphs
Journal of Automation and Information Sciences, Vol.51, 2019, issue 7
Artem L. Gurin , Andrey G. Donets , Sergiy Zagorodnyuk
Search for the Global Minimum of a Nondifferentiable Function by the Method of Optimal Set Partitioning
Journal of Automation and Information Sciences, Vol.34, 2002, issue 3
Elena M. Kiseleva, Tatyana F. Stepanchuk
Uniform Approximations of Functions of Lipschitz Class by Threeharmonic Poisson Integrals
Journal of Automation and Information Sciences, Vol.49, 2017, issue 12
Ulyana Z. Hrabova
CROSS-ENTROPY MEASURES OF MULTIVALUED NEUTROSOPHIC SETS AND ITS APPLICATION IN SELECTING MIDDLE-LEVEL MANAGER
International Journal for Uncertainty Quantification, Vol.7, 2017, issue 2
Jian-Qiang Wang, Xiao-Hui Wu