Treffer: A new algorithm for large-scale scheduling problems : Sequence branch algorithm
Title:
A new algorithm for large-scale scheduling problems : Sequence branch algorithm
Authors:
Source:
Industrial & engineering chemistry research. 37(10):4049-4058
Publisher Information:
Washington, DC: American Chemical Society, 1998.
Publication Year:
1998
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Biotechnology, Biotechnologies, Energy, Énergie, Chemical engineering, Génie chimique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Ordonnancement, Scheduling, sequencing, Electronique, Electronics, Electronique des semiconducteurs. Microélectronique. Optoélectronique. Dispositifs à l'état solide, Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices, Fabrication microélectronique (technologie des matériaux et des surfaces), Microelectronic fabrication (materials and surfaces technology), Fabrication microélectronique, Microelectronic fabrication, Fabricación microeléctrica, Méthode heuristique, Heuristic method, Método heurístico, Ordonnancement, Scheduling, Ordonamiento, Procédé discontinu, Batch process, Procedimiento discontínuo, Production par lot, Batch production, Producción por lote, Semiconducteur, Semiconductor materials, Semiconductor(material), Sequence branch method
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Chemical Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon 305-701, Korea, Republic of
ISSN:
0888-5885
Rights:
Copyright 1998 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Electronics
Operational research. Management
Operational research. Management
Accession Number:
edscal.2399062
Database:
PASCAL Archive
Weitere Informationen
Mixed integer linear programming based methods have been widely employed but have been limited to problems with simple recipes or small-scale scheduling problems. This paper proposes the sequence branch algorithm (SBA) that can handle large-scale complex scheduling problems for batch processes under unlimited intermediate storage policy. The SBA generates the schedule tree in which all feasible schedules are included. A heuristic function is employed to accelerate the searching speed and it causes the results somewhat deviated from the optimal solution. The efficiency of the proposed algorithm is illustrated through complex and large-scale problems including a case study of a semiconductor fabrication process.