Relevant bibliographies by topics / Assembly scheduling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Assembly scheduling'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Assembly scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Assembly scheduling"

1

Lu, Zhi Bing, Ai Min Wang, Cheng Tong Tang, and Jing Sheng Li. "Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections." Applied Mechanics and Materials 271-272 (December 2012): 650–56. http://dx.doi.org/10.4028/www.scientific.net/amm.271-272.650.

Full text
Abstract:
For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.
APA, Harvard, Vancouver, ISO, and other styles
2

Little, David, and Andrew Hemmings. "Scheduling Automated Assembly Systems." Assembly Automation 13, no. 4 (1993): 8–13. http://dx.doi.org/10.1108/eb004401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Song, Hailong, Shengluo Yang, Shuoxin Yin, Junyi Wang, and Zhigang Xu. "Intelligent Scheduling of a Pulsating Assembly Flow Shop Considering a Multifunctional Automated Guided Vehicle." Applied Sciences 15, no. 5 (2025): 2593. https://doi.org/10.3390/app15052593.

Full text
Abstract:
The pulsating assembly line is widely used in modern manufacturing, particularly in high-precision industries such as aerospace, where it greatly enhances production efficiency. To achieve overall optimization, both product scheduling and Automated Guided Vehicle (AGV) scheduling must be simultaneously optimized. However, existing research predominantly focuses on product scheduling, with limited attention given to AGV scheduling. This paper proposes an optimized solution for the pulsating assembly line scheduling problem, incorporating multifunctional AGV scheduling. A mathematical model is developed and three AGV selection strategies and three AGV standby strategies are designed to optimize AGV scheduling and control. To improve scheduling efficiency, nine heuristic strategies are introduced, along with the Variable Neighborhood Descent (VND) algorithm as a metaheuristic method for product scheduling. The VND algorithm refines the solution through multiple neighborhood searches, enhancing both the precision and efficiency of product scheduling. Our experimental results demonstrate that the proposed strategies significantly improve the production efficiency of pulsating assembly workshops, reduce AGV scheduling costs, and optimize overall production workflows. This study offers novel methods for intelligent scheduling in pulsating assembly workshops, contributing to the advancement of manufacturing toward “multiple varieties, small batches, and customization”.
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Sheng Hui, Shu Li Zhang, and Hong Bo Xu. "An Assembly Scheduling Model for Complex Machine Product." Applied Mechanics and Materials 380-384 (August 2013): 4643–46. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.4643.

Full text
Abstract:
According to the characteristics of assembly scheduling, an assembly scheduling model for complex machine product was defined in this paper. The assembly relationship of a complex machine product is expressed by a job assembly graph. A job assembly graph is translated into an assembly process graph. The assembly process graph is a tree-form. There is a partial order between each child node and its parent in the assembly process graph. Then an assembly scheduling algorithm for complex machine product is given. The goal of the algorithm is minimizing total assembling time. The algorithm could always gain a good assembly schedule through minimizing the waiting time of all assembling operations. The feasibility and efficiency of the algorithm was verified through an example.
APA, Harvard, Vancouver, ISO, and other styles
5

Hu, Xiaomei, Zhenghao Xu, Long Yang, and Rujiang Zhou. "A Novel Assembly Line Scheduling Algorithm Based on CE-PSO." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/685824.

Full text
Abstract:
With the widespread application of assembly line in enterprises, assembly line scheduling is an important problem in the production since it directly affects the productivity of the whole manufacturing system. The mathematical model of assembly line scheduling problem is put forward and key data are confirmed. A double objective optimization model based on equipment utilization and delivery time loss is built, and optimization solution strategy is described. Based on the idea of solution strategy, assembly line scheduling algorithm based on CE-PSO is proposed to overcome the shortcomings of the standard PSO. Through the simulation experiments of two examples, the validity of the assembly line scheduling algorithm based on CE-PSO is proved.
APA, Harvard, Vancouver, ISO, and other styles
6

Sotskov, Yuri N. "Assembly and Production Line Designing, Balancing and Scheduling with Inaccurate Data: A Survey and Perspectives." Algorithms 16, no. 2 (2023): 100. http://dx.doi.org/10.3390/a16020100.

Full text
Abstract:
Assembly lines (conveyors) are traditional means of large-scale and mass-scale productions. An assembly line balancing problem is needed for optimizing the assembly process by configuring and designing an assembly line for the same or similar types of final products. This problem consists of designing the assembly line and distributing the total workload for manufacturing each unit of the fixed product to be assembled among the ordered workstations along the constructed assembly line. The assembly line balancing research is focused mainly on simple assembly line balancing problems, which are restricted by a set of conditions making a considered assembly line ideal for research. A lot of published research has been carried out in order to describe and solve (usually heuristically) more realistic generalized assembly line balancing problems. Assembly line designing, balancing and scheduling problems with not deterministic (stochastic, fuzzy or uncertain) parameters have been investigated in many published research works. This paper is about the design and optimization methods for assembly and disassembly lines. We survey the recent developments for designing, balancing and scheduling assembly (disassembly) lines. New formulations of simple assembly line balancing problems are presented in order to take into account modifications and uncertainties characterized by real assembly productions.
APA, Harvard, Vancouver, ISO, and other styles
7

Kuo, Chung Hsien, M. D. Jeng, J. J. Wing, and Tai Hong Wang. "Optimization of Component Placement Scheduling for SMT Assemblies." Materials Science Forum 505-507 (January 2006): 1123–28. http://dx.doi.org/10.4028/www.scientific.net/msf.505-507.1123.

Full text
Abstract:
The surface mounting of electronic component is the major manufacturing technology for the electronic products in the last decade. The surface mounting technology (SMT) is an assembly process that assembles the surface mountable component (SMC) and the printed circuit board (PCB) together. The SMT mounter is an automatic assembly machine that processes the SMT assemblies in terms of the optical positioning and robotic handling. The SMT assembly consists of calibrating printed circuit board (PCB); vacuuming components form feeder stations; compensating the orientation of the vacuumed surface mountable component (SMC); and finally placing SMC chips on the PCB. In order to increase the throughput, the synchronous batch vacuuming of SMC components is designed. In addition, different types of component feeding and mixing in each batch increase the difficulties of finding the best component mounting sequence. In this paper, the optimal component placement scheduler is desired to perform higher assembly performance and to reduce the cycle time. The proposed optimal component placement scheduler is developed based on the rule based heuristic search approach. In addition, to evaluate the cycle time of each heuristic search, the route oriented Petri nets (ROPN) based SMT assembly models are constructed. The optimal component placement scheduler can be further determined in terms of evaluating the ROPN SMT assembly models. Finally, the practical test PCB board data is discussed in this paper.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Zhenhua, and Youling Chen. "Research on Assembly Scheduling of Complex Electromechanical Products Based on Improved Particle Swarm Optimization." Journal of Physics: Conference Series 2229, no. 1 (2022): 012011. http://dx.doi.org/10.1088/1742-6596/2229/1/012011.

Full text
Abstract:
Abstract The assembly shop production scheduling of complex electromechanical products is a typical discrete variable NP-hard problem. In order to solve the assembly job scheduling problem of a large transformer assembly shop, an improved particle swarm algorithm is used to solve the optimal assembly task scheduling result. In order to minimize the maximum completion time, the traditional particle swarm optimization (PSO) algorithm was improved according to the characteristics of large transformer assembly process. First, the two-stage coding method of process and assembly team is adopted. Then, in order to improve the quality of the initial solution, the initialization method that minimizes the completion time is selected, and the adaptive inertia weight optimization speed update formula is adopted. Finally, the simulation study is carried out with relevant example data. Compared with the traditional PSO, the maximum completion time and convergence speed are significantly improved, which verifies the effectiveness of the improved PSO, and obtains the production scheduling Gantt chart of the workshop.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Zhicong, Kaishun Hu, Shuai Li, Huiyu Huang, and Shaoyong Zhao. "Chip Attach Scheduling in Semiconductor Assembly." Journal of Industrial Engineering 2013 (March 26, 2013): 1–11. http://dx.doi.org/10.1155/2013/295604.

Full text
Abstract:
Chip attach is the bottleneck operation in semiconductor assembly. Chip attach scheduling is in nature unrelated parallel machine scheduling considering practical issues, for example, machine-job qualification, sequence-dependant setup times, initial machine status, and engineering time. The major scheduling objective is to minimize the total weighted unsatisfied Target Production Volume in the schedule horizon. To apply Q-learning algorithm, the scheduling problem is converted into reinforcement learning problem by constructing elaborate system state representation, actions, and reward function. We select five heuristics as actions and prove the equivalence of reward function and the scheduling objective function. We also conduct experiments with industrial datasets to compare the Q-learning algorithm, five action heuristics, and Largest Weight First (LWF) heuristics used in industry. Experiment results show that Q-learning is remarkably superior to the six heuristics. Compared with LWF, Q-learning reduces three performance measures, objective function value, unsatisfied Target Production Volume index, and unsatisfied job type index, by considerable amounts of 80.92%, 52.20%, and 31.81%, respectively.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Hao Xiang, and Hong Sen Yan. "An Adaptive Assembly Scheduling Approach in Knowledgeable Manufacturing." Applied Mechanics and Materials 433-435 (October 2013): 2347–50. http://dx.doi.org/10.4028/www.scientific.net/amm.433-435.2347.

Full text
Abstract:
To address the uncertainty of production environment in aircraft engine assembly, an adaptive optimization scheduling algorithm is designed for an aircraft engine assembly line in knowledgeable manufacturing. A Q-learning adaptive scheduling model of aircraft engine assembly is built on the objective function of minimizing earliness penalty. Simulation experiments indicate that the proposed algorithm outperforms other scheduling rules much. Especially, better results are generally achieved with the increase in number of engines to show good adaptive performance.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Assembly scheduling"

1

Hatami, Sara. "The Distributed and Assembly Scheduling Problem." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/64072.

Full text
Abstract:
[EN] Nowadays, manufacturing systems meet different new global challenges and the existence of a collaborative manufacturing environment is essential to face with. Distributed manufacturing and assembly systems are two manufacturing systems which allow industries to deal with some of these challenges. This thesis studies a production problem in which both distributed manufacturing and assembly systems are considered. Although distributed manufacturing systems and assembly systems are well-known problems and have been extensively studied in the literature, to the best of our knowledge, considering these two systems together as in this thesis is the first effort in the literature. Due to the importance of scheduling optimization on production performance, some different ways to optimize the scheduling of the considered problem are discussed in this thesis. The studied scheduling setting consists of two stages: A production and an assembly stage. Various production centers make the first stage. Each of these centers consists of several machines which are dedicated to manufacture jobs. A single assembly machine is considered for the second stage. The produced jobs are assembled on the assembly machine to form final products through a defined assembly program. In this thesis, two different problems regarding two different production configurations for the production centers of the first stage are considered. The first configuration is a flowshop that results in what we refer to as the Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). The second problem is referred to as the Distributed Parallel Machine and Assembly Scheduling Problem (DPMASP), where unrelated parallel machines configure the production centers. Makespan minimization of the product on the assembly machine located in the assembly stage is considered as the objective function for all considered problems. In this thesis some extensions are considered for the studied problems so as to bring them as close as possible to the reality of production shops. In the DAPFSP, sequence dependent setup times are added for machines in both production and assembly stages. Similarly, in the DPMASP, due to technological constraints, some defined jobs can be processed only in certain factories. Mathematical models are presented as an exact solution for some of the presented problems and two state-of-art solvers, CPLEX and GUROBI are used to solve them. Since these solvers are not able to solve large sized problems, we design and develop heuristic methods to solve the problems. In addition to heuristics, some metaheuristics are also designed and proposed to improve the solutions obtained by heuristics. Finally, for each proposed problem, the performance of the proposed solution methods is compared through extensive computational and comprehensive ANOVA statistical analysis.<br>[ES] Los sistemas de producción se enfrentan a retos globales en los que el concepto de fabricación colaborativa es crucial para poder tener éxito en el entorno cambiante y complejo en el que nos encontramos. Una característica de los sistemas productivos que puede ayudar a lograr este objetivo consiste en disponer de una red de fabricación distribuida en la que los productos se fabriquen en localizaciones diferentes y se vayan ensamblando para obtener el producto final. En estos casos, disponer de modelos y herramientas para mejorar el rendimiento de sistemas de producción distribuidos con ensamblajes es una manera de asegurar la eficiencia de los mismos. En esta tesis doctoral se estudian los sistemas de fabricación distribuidos con operaciones de ensamblaje. Los sistemas distribuidos y los sistemas con operaciones de ensamblaje han sido estudiados por separado en la literatura. De hecho, no se han encontrado estudios de sistemas con ambas características consideradas de forma conjunta. Dada la complejidad de considerar conjuntamente ambos tipos de sistemas a la hora de realizar la programación de la producción en los mismos, se ha abordado su estudio considerando un modelo bietápico en la que en la primera etapa se consideran las operaciones de producción y en la segunda se plantean las operaciones de ensamblaje. Dependiendo de la configuración de la primera etapa se han estudiado dos variantes. En la primera variante se asume que la etapa de producción está compuesta por sendos sistemas tipo flowshop en los que se fabrican los componentes que se ensamblan en la segunda etapa (Distributed Assembly Permutation Flowshop Scheduling Problem o DAPFSP). En la segunda variante se considera un sistema de máquinas en paralelo no relacionadas (Distributed Parallel Machine and Assembly Scheduling Problem o DPMASP). En ambas variantes se optimiza la fecha de finalización del último trabajo secuenciado (Cmax) y se contempla la posibilidad que existan tiempos de cambio (setup) dependientes de la secuencia de trabajos fabricada. También, en el caso DPMASP se estudia la posibilidad de prohibir o no el uso de determinadas máquinas de la etapa de producción. Se han desarrollado modelos matemáticos para resolver algunas de las variantes anteriores. Estos modelos se han resuelto mediante los programas CPLEX y GUROBI en aquellos casos que ha sido posible. Para las instancias en los que el modelo matemático no ofrecía una solución al problema se han desarrollado heurísticas y metaheurísticas para ello. Todos los procedimientos anteriores han sido estudiados para determinar el rendimiento de los diferentes algoritmos planteados. Para ello se ha realizado un exhaustivo estudio computacional en el que se han aplicado técnicas ANOVA. Los resultados obtenidos en la tesis permiten avanzar en la comprensión del comportamiento de los sistemas productivos distribuidos con ensamblajes, definiendo algoritmos que permiten obtener buenas soluciones a este tipo de problemas tan complejos que aparecen tantas veces en la realidad industrial.<br>[CAT] Els sistemes de producció s'enfronten a reptes globals en què el concepte de fabricació col.laborativa és crucial per a poder tindre èxit en l'entorn canviant i complex en què ens trobem. Una característica dels sistemes productius que pot ajudar a aconseguir este objectiu consistix a disposar d'una xarxa de fabricació distribuïda en la que els productes es fabriquen en localitzacions diferents i es vagen acoblant per a obtindre el producte final. En estos casos, disposar de models i ferramentes per a millorar el rendiment de sistemes de producció distribuïts amb acoblaments és una manera d'assegurar l'eficiència dels mateixos. En esta tesi doctoral s'estudien els sistemes de fabricació distribuïts amb operacions d'acoblament. Els sistemes distribuïts i els sistemes amb operacions d'acoblament han sigut estudiats per separat en la literatura però, en allò que es coneix, no s'han trobat estudis de sistemes amb ambdós característiques conjuntament. Donada la complexitat de considerar conjuntament ambdós tipus de sistemes a l'hora de realitzar la programació de la producció en els mateixos, s'ha abordat el seu estudi considerant un model bietàpic en la que en la primera etapa es consideren les operacions de producció i en la segona es plantegen les operacions d'acoblament. Depenent de la configuració de la primera etapa s'han estudiat dos variants. En la primera variant s'assumix que l'etapa de producció està composta per sengles sistemes tipus flowshop en els que es fabriquen els components que s'acoblen en la segona etapa (Distributed Assembly Permutation Flowshop Scheduling Problem o DAPFSP). En la segona variant es considera un sistema de màquines en paral.lel no relacionades (Distributed Parallel Machine and Assembly Scheduling Problem o DPMASP). En ambdós variants s'optimitza la data de finalització de l'últim treball seqüenciat (Cmax) i es contempla la possibilitat que existisquen temps de canvi (setup) dependents de la seqüència de treballs fabricada. També, en el cas DPMASP s'estudia la possibilitat de prohibir o no l'ús de determinades màquines de l'etapa de producció. S'han desenvolupat models matemàtics per a resoldre algunes de les variants anteriors. Estos models s'han resolt per mitjà dels programes CPLEX i GUROBI en aquells casos que ha sigut possible. Per a les instàncies en què el model matemàtic no oferia una solució al problema s'han desenrotllat heurístiques i metaheurísticas per a això. Tots els procediments anteriors han sigut estudiats per a determinar el rendiment dels diferents algoritmes plantejats. Per a això s'ha realitzat un exhaustiu estudi computacional en què s'han aplicat tècniques ANOVA. Els resultats obtinguts en la tesi permeten avançar en la comprensió del comportament dels sistemes productius distribuïts amb acoblaments, definint algoritmes que permeten obtindre bones solucions a este tipus de problemes tan complexos que apareixen tantes vegades en la realitat industrial.<br>Hatami, S. (2016). The Distributed and Assembly Scheduling Problem [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/64072<br>TESIS
APA, Harvard, Vancouver, ISO, and other styles
2

OKUMA, Shigeru, Tatsuya SUZUKI, Fumiharu FUJIWARA, and Akio INABA. "Timed Petri Net Based Scheduling for Mechanical Assembly : Integration of Planning and Scheduling." Institute of Electronics, Information and Communication Engineers, 1998. http://hdl.handle.net/2237/14986.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dong, Yanan. "Optimal scheduling for SMT assembly line using neural networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0025/MQ35833.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Burdett, Robert. "Sequencing and scheduling theory for mixed-model multi-stage assembly environment." Thesis, Queensland University of Technology, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hayes, Brian C. "Performance oriented scheduling with power constraints." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sikora, Celso Gustavo Stall. "Scheduling projects in operating systems: an application on assembly line balancing." Universidade Tecnológica Federal do Paraná, 2017. http://repositorio.utfpr.edu.br/jspui/handle/1/2859.

Full text
Abstract:
Fundação Araucária; RENAULT; Seti<br>A Pesquisa Operacional investiga as (melhores) formas de se configurar e coordenar sistemas ou operações usando técnicas de otimização. Geralmente, a otimização de um sistema é modelado com base no estado final almejado. Porém, como atingir ou implementar tal estado final em sistemas é pouco retratado na literatura. Esta dissertaçãode mestrado propõe uma nova classe de problema de otimização: a programação das operações entre o estado inicial e o final de um sistema, o Problema de Implementação. A programação das operações é especialmente importante para linhas de montagem. A indústria automobilística é fortemente baseada em linhas de produção que podem ser usadas até 24 horas por dia. Assim, as oportunidades de intervenções para mudar ou otimizar o sistema produtivo são poucas. As condições de implementação aplicadas ao balanceamento de linhas produtivas são discutidas, e as características observadas resultam no proposto Problema de Implementação de Linhas de Montagem (PILM). Na dissertação, um guia de modelagem baseado em Programação Linear Inteira Mista (PLIM) é desenvolvido para a formulação de diversas variações do Problema de Implementação. As instruções de modelagem são usadas para desenvolver um conjunto de modelos PLIM para o Problema de Implementação de Linhas de Montagem. Para a obtenção de resultados, um conjunto de instâncias é proposto. Assim, uma análise de sensibilidade em função de cada um dos parâmetros formadores das instâncias é realizada. As formulações são comparadas, junto com as diferentes formas de apresentar e resolver o problema. Ademais, um método de decomposição é usado para resolver um problema industrial real. A modelagem mostrase correta para a divisão da implementação de mudanças em linhas de montagem. Os resultados mostram que a divisão do esforço de implementação resulta em apenas poucas mudanças a mais (cerca de 7% para os casos pequenos e médios) comparadas com a implementação em uma fase. A possibilidade de programar a implementação em etapas menores aumenta a aplicabilidade de projetos, que, de outra forma, requeririam grande paradas de produção.<br>Operations Research investigates the (best) ways to configure and coordinate systems or operations with optimization procedures. Usually, the optimization of a system is modeled based on the aimed final configuration. However, little is published about how to reach or implement such optimal configurations in the systems. This master thesis proposes a new class of optimization problem: a scheduling of operations between initial and final states of a system, the Implementation Problem. The scheduling of operations is especially important to assembly lines. The automotive industry strongly relies on production lines that can operate 24 hours a day. Thus, the intervention opportunities to change or optimize the production system are very few. The implementation conditions of balancing on assembly lines are discussed, and the observed characteristics result in the proposal of the Assembly Line Implementation Problem (ALIP). The master thesis proposes a Mixed-Integer Linear Programming (MILP) modeling guide for the formulation of several variations of Implementation Problems. The modeling instructions are used to develop a set of MILP models for the Assembly Line Implementation Problem. For the results, a dataset is proposed and a sensitivity analysis on each of the consistent parameters of the dataset is performed. The proposed formulations are compared, along with the different forms of presenting and solving the problem. Furthermore, a decomposition method is used to solve a real-world industrial problem. The modeling correctly represents the division of the implementation of changes in assembly lines. The results show that the division of the effort in multiple stages only need a few more changes (around 7\% for the small and medium cases) comparing to a straightforward implementation. The possibility of scheduling the implementation in smaller steps increases the applicability of projects that otherwise would require a large system's stoppage time.
APA, Harvard, Vancouver, ISO, and other styles
7

Das, Sanchoy K. "Selection of an optimal set of assembly part delivery dates in a stochastic assembly system." Thesis, Virginia Tech, 1985. http://hdl.handle.net/10919/45640.

Full text
Abstract:
<p>The scheduling of material requirements at a factory to maximize profits.or productivity is a difficult mathematical problem. The stochastic nature of most production setups introduces additional complications as a result of the uncertainty involved in vendor reliability and processing times. But in developing the descriptive model for a system, a true representation can only be attained if the variability of these elements is considered.</p> <p>Here we present the development of a normative model based on a new type of descriptive model which considers the element of stochasticity. The arrival time of an assembly part from a vendor is considered to be a normally distributed random variable. We attempt to optimize the system with regard to work-in-process inventory using a dynamic programming algorithm in combination with a heuristic procedure. The decision variable is the prescribed assembly part delivery date. The model is particularly suitable for application in low volume assembly lines, where products are manufactured in discrete batches.</p><br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
8

Qin, Wei, and 秦威. "RFID-enabled real-time scheduling for assembly islands with fixed-position layouts." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46971993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wong, Tse-chiu. "An evolutionary algorithm approach for assembly job shop scheduling with lot streaming technique." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B39634462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wong, Tse-chiu, and 黃資超. "An evolutionary algorithm approach for assembly job shop scheduling with lot streaming technique." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B39634462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Assembly scheduling"

1

Abd, Khalid Karam. Intelligent Scheduling of Robotic Flexible Assembly Cells. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-26296-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sawik, Tadeusz. Production Planning and Scheduling in Flexible Assembly Systems. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58614-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Scholl, Armin. Balancing and sequencing of assembly lines. Physica-Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kovalyov, M. Y. Assembly scheduling with batching. University of Greenwich, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Intelligent Scheduling of Robotic Flexible Assembly Cells. Springer International Publishing AG, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abd, Khalid Karam. Intelligent Scheduling of Robotic Flexible Assembly Cells. Springer, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abd, Khalid Karam. Intelligent Scheduling of Robotic Flexible Assembly Cells. Springer, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Production planning and scheduling in flexible assembly systems. Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Production Planning and Scheduling in Flexible Assembly Systems. Springer Berlin Heidelberg, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Production Planning and Scheduling in Flexible Assembly Systems. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Assembly scheduling"

1

Kolisch, Rainer. "Operations Scheduling." In Make-to-Order Assembly Management. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04514-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Nof, Shimon Y., Wilbert E. Wilhelm, and Hans-Jürgen Warnecke. "Sequencing and scheduling of assembly operations." In Industrial Assembly. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6393-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kolisch, Rainer. "Operations Scheduling Methods." In Make-to-Order Assembly Management. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04514-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pinedo, Michael L. "Scheduling of Flexible Assembly Systems." In Planning and Scheduling in Manufacturing and Services. Springer New York, 2009. http://dx.doi.org/10.1007/978-1-4419-0910-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Choi, Byung-Wook. "Manufacturing System Scheduling and Controlling." In Frontiers of Assembly and Manufacturing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14116-4_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sawik, Tadeusz. "Production Scheduling in Flexible Assembly Lines." In Production Planning and Scheduling in Flexible Assembly Systems. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58614-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cechowicz, Radoslaw. "Holonic Scheduling for an Assembly Line." In Soft Computing and Industry. Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-0123-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sawik, Tadeusz. "Loading and Scheduling in Flexible Assembly Cells." In Production Planning and Scheduling in Flexible Assembly Systems. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-642-58614-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vincent, Lui Wen Han, and S. G. Ponnambalam. "Scheduling Flexible Assembly Lines Using Differential Evolution." In Swarm, Evolutionary, and Memetic Computing. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-27172-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Müller-Hannemann, Matthias, and Karsten Weihe. "Moving Policies in Cyclic Assembly-Line Scheduling." In Parameterized and Exact Computation. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-28639-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Assembly scheduling"

1

Zhao, Jingyun, Birgit Vogel-Heuser, Jicong Ao, et al. "Ontology Based AI Planning and Scheduling for Robotic Assembly." In 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2024. https://doi.org/10.1109/iros58592.2024.10802295.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hao, Haiqiang, and Haiping Zhu. "ASimulated Logistic Algorithm for Distributed Flexible Assembly Flowshop Scheduling with Post-processing." In 2024 XV International Symposium on Industrial Electronics and Applications (INDEL). IEEE, 2024. https://doi.org/10.1109/indel62640.2024.10772683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mafteiu-Scai, Roxana-Teodora. "Learning Dispatching Rules for Flexible Assembly Scheduling Problems Using Deep Reinforcement Learning." In 2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2024. https://doi.org/10.1109/synasc65383.2024.00067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Al-anzi, Fawaz, and Ali Allahverdi. "Computer Assembly Scheduling Problem." In 2006 International Conference on Service Systems and Service Management. IEEE, 2006. http://dx.doi.org/10.1109/icsssm.2006.320677.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chauvet, Fabrice, and Jean-Marie Proth. "Real-time Scheduling for Assembly Processes." In Aerospace Manufacturing Technology Conference & Exposition. SAE International, 1998. http://dx.doi.org/10.4271/981871.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mahdavi, I., Gh M. Komaki, and V. Kayvanfar. "Aggregate hybrid flowshop scheduling with assembly operations." In 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management. IEEE, 2011. http://dx.doi.org/10.1109/icieem.2011.6035244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Meng, Yu. "A new study of assembly scheduling effective constraint method in assembly planning." In 2nd International Conference on Computer and Information Applications (ICCIA 2012). Atlantis Press, 2012. http://dx.doi.org/10.2991/iccia.2012.440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yang, Yahui, and Zezhi Ren. "Research and Application of Assembly Planning and Scheduling System for Automobile Assembly MES." In 2013 Fifth International Conference on Computational and Information Sciences (ICCIS). IEEE, 2013. http://dx.doi.org/10.1109/iccis.2013.319.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhu, Xiaowei, Hui Wang, S. Jack Hu, and Yoram Koren. "Build Sequence Scheduling to Minimize Complexity in Mixed-Model Assembly Lines." In ASME 2008 9th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2008. http://dx.doi.org/10.1115/esda2008-59061.

Full text
Abstract:
Build sequence scheduling is an important topic in mixed-model production. It is to determine the order of products being built in the assembly line. Significant research has been conducted to determine good sequences based on various criteria. For example, in Just-In-Time production systems, optimal sequences are searched to minimize the variation in the rate at which different parts were consumed. This paper discusses the selection of optimal build sequences based on complexity introduced by product variety in mixed-model assembly line. The complexity was defined as the information entropy that operator processes during assembly, which indirectly measures the human performance in making choices, such as selecting parts, tools, fixtures, and assembly procedures in a multi-product, multi-stage, manual assembly environment. In an earlier paper by the authors, a simple version of complexity measure has been developed for i.i.d. (independent identically distributed) sequences. This paper extends the concept and takes into account the sequential dependence of the choices and its impact on build sequence schedules. A model based on Hidden Markov Chain is proposed to model the sequence scheduling problem with the constraints by spacing rules. Methodologies developed in this paper enhance the previous work on modeling complexity, and provide solution strategies for build sequence scheduling to minimize complexity.
APA, Harvard, Vancouver, ISO, and other styles
10

Pappe, Falk Stefan, Evangelos Angelidis, and Oliver Rose. "Framework for simulation based scheduling of assembly lines." In 2010 Winter Simulation Conference - (WSC 2010). IEEE, 2010. http://dx.doi.org/10.1109/wsc.2010.5678902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Assembly scheduling' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography