Littérature scientifique sur le sujet « Mixed blocking constraints »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Mixed blocking constraints ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Mixed blocking constraints"
Sauvey, Christophe, Wajdi Trabelsi et Nathalie Sauer. « Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems ». Mathematics 8, no 1 (13 janvier 2020) : 121. http://dx.doi.org/10.3390/math8010121.
Texte intégralTrabelsi, Wajdi, Christophe Sauvey et Nathalie Sauer. « Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ». Computers & ; Operations Research 39, no 11 (novembre 2012) : 2520–27. http://dx.doi.org/10.1016/j.cor.2011.12.022.
Texte intégralRiahi, Vahid, M. A. Newton, Kaile Su et Abdul Sattar. « Local Search for Flowshops with Setup Times and Blocking Constraints ». Proceedings of the International Conference on Automated Planning and Scheduling 28 (15 juin 2018) : 199–207. http://dx.doi.org/10.1609/icaps.v28i1.13895.
Texte intégralTighazoui, A., C. Sauvey et N. Sauer. « New efficiency-stability criterion for flow shop rescheduling problem with mixed blocking constraints ». IFAC-PapersOnLine 54, no 1 (2021) : 1181–86. http://dx.doi.org/10.1016/j.ifacol.2021.08.139.
Texte intégralKhorramizadeh, Mostafa, et Vahid Riahi. « A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems ». Mathematical Problems in Engineering 2015 (2015) : 1–10. http://dx.doi.org/10.1155/2015/612604.
Texte intégralTrabelsi, Wajdi, Christophe Sauvey et Nathalie Sauer. « Mathematical Model and Lower Bound for Hybrid Flowshop Problem With Mixed Blocking Constraints ». IFAC Proceedings Volumes 45, no 6 (mai 2012) : 1475–80. http://dx.doi.org/10.3182/20120523-3-ro-2023.00310.
Texte intégralZhang, Ningyu, Qian Zhou et Haoming Hu. « Minimum Frequency and Voltage Stability Constrained Unit Commitment for AC/DC Transmission Systems ». Applied Sciences 9, no 16 (19 août 2019) : 3412. http://dx.doi.org/10.3390/app9163412.
Texte intégralParadis, Johanne, Elena Nicoladis et Fred Genesee. « Early emergence of structural constraints on code-mixing : evidence from French–English bilingual children ». Bilingualism : Language and Cognition 3, no 3 (décembre 2000) : 245–61. http://dx.doi.org/10.1017/s1366728900000365.
Texte intégralZhang, Chenyao, Yuyan Han, Yuting Wang, Junqing Li et Kaizhou Gao. « A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm ». Mathematics 11, no 3 (22 janvier 2023) : 581. http://dx.doi.org/10.3390/math11030581.
Texte intégralKawal, Kevin, Steven Blair, Qiteng Hong et Panagiotis N. Papadopoulos. « Selective Auto-Reclosing of Mixed Circuits Based on Multi-Zone Differential Protection Principle and Distributed Sensing ». Energies 16, no 6 (8 mars 2023) : 2558. http://dx.doi.org/10.3390/en16062558.
Texte intégralThèses sur le sujet "Mixed blocking constraints"
Tighazoui, Ayoub. « Ré-ordonnancement des systèmes de production flexibles avec contraintes de blocage mixtes soumis à des aléas de commandes ou de production ». Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0187.
Texte intégralToday’s digital transformation has definitely changed the customers practices. In fact, through the new information and communication tools, a customer can at any time create, modify, or cancel an order. These unexpected events have a direct impact on the work organization of the production unit, generating a disruption of the already established schedule. Therefore, a rescheduling process is necessary for efficiently revising the existing schedule, preferably with less movements. In this Ph.D, mathematical models and optimization methods are developed for rescheduling problems, under different types of disruptions, in several machine environments. The performance of the obtained solutions is measured with a new criterion, simultaneously combining the schedule efficiency and stability.The predictive-reactive scheduling strategy has been adopted in this work. It consists, in the predictive phase, to solve a classical scheduling problem minimizing the Total Weighted Waiting Time (TWWT) of the jobs, regarded as the schedule efficiency criterion. After the disruption appearance, the reactive phase starts. It consists in updating the initial problem by modifying its data, then solving the new rescheduling problem with the objective of minimizing the TWWT combined with a stability criterion. The schedule stability is measured with the Total Weighted Completion Time Deviation (TWCTD). This association of criteria is significant, and it can be very helpful in industrial applications, where the job waiting time estimates the duration that the job has waited in front of a workstation. The stability criterion is then used for limiting the deviation from the already established schedule, since this matter generates supplementary costs.This approach has been applied for different machine environments. Firstly, on a single machine, illustrating the case of a single workstation. Secondly, on parallel machines, describing the case of identical workstations. Finally, on a flowshop system where a set of jobs are treated in the same order by a set of machines. The flowshop rescheduling problem is also considered with mixed blocking constraints.These rescheduling problems have firstly been modeled as Mixed Integer Linear Programing (MILP) models. Due to their NP-hard complexity, the resolution is only possible for a limited number of jobs. Thus, heuristic methods have been designed, exploring more jobs in a reasonable time. The proposed methods have been discussed and analyzed, both in terms of solution quality and computing time
Chapitres de livres sur le sujet "Mixed blocking constraints"
Sauvey, Christophe, Nathalie Sauer et Wajdi Trabelsi. « Job-Shop Scheduling with Mixed Blocking Constraints between Operations ». Dans Advances in Intelligent Systems and Computing, 331–42. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18167-7_29.
Texte intégralWang, Feng, Qingcheng Zhu, Xiaolong Li, Jiaming Gu, Zhenhua Yan, Xiaosong Yu et Yongli Zhao. « Spectrum Availability Aware Routing and Resource Allocation for Point-to-Multipoint Services in Mixed-Grid Optical Networks ». Dans Proceedings of CECNet 2021. IOS Press, 2021. http://dx.doi.org/10.3233/faia210446.
Texte intégralActes de conférences sur le sujet "Mixed blocking constraints"
Sauvey, Christophe, et Wajdi Trabelsi. « Hybrid job shop scheduling with mixed blocking constraints between operations ». Dans 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA). IEEE, 2015. http://dx.doi.org/10.1109/etfa.2015.7301538.
Texte intégral