Letteratura scientifica selezionata sul tema "Mixed blocking constraints"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Mixed blocking constraints".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "Mixed blocking constraints":
Sauvey, Christophe, Wajdi Trabelsi e Nathalie Sauer. "Mathematical Model and Evaluation Function for Conflict-Free Warranted Makespan Minimization of Mixed Blocking Constraint Job-Shop Problems". Mathematics 8, n. 1 (13 gennaio 2020): 121. http://dx.doi.org/10.3390/math8010121.
Trabelsi, Wajdi, Christophe Sauvey e Nathalie Sauer. "Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems". Computers & Operations Research 39, n. 11 (novembre 2012): 2520–27. http://dx.doi.org/10.1016/j.cor.2011.12.022.
Riahi, Vahid, M. A. Newton, Kaile Su e Abdul Sattar. "Local Search for Flowshops with Setup Times and Blocking Constraints". Proceedings of the International Conference on Automated Planning and Scheduling 28 (15 giugno 2018): 199–207. http://dx.doi.org/10.1609/icaps.v28i1.13895.
Tighazoui, A., C. Sauvey e N. Sauer. "New efficiency-stability criterion for flow shop rescheduling problem with mixed blocking constraints". IFAC-PapersOnLine 54, n. 1 (2021): 1181–86. http://dx.doi.org/10.1016/j.ifacol.2021.08.139.
Khorramizadeh, Mostafa, e 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.
Trabelsi, Wajdi, Christophe Sauvey e Nathalie Sauer. "Mathematical Model and Lower Bound for Hybrid Flowshop Problem With Mixed Blocking Constraints". IFAC Proceedings Volumes 45, n. 6 (maggio 2012): 1475–80. http://dx.doi.org/10.3182/20120523-3-ro-2023.00310.
Zhang, Ningyu, Qian Zhou e Haoming Hu. "Minimum Frequency and Voltage Stability Constrained Unit Commitment for AC/DC Transmission Systems". Applied Sciences 9, n. 16 (19 agosto 2019): 3412. http://dx.doi.org/10.3390/app9163412.
Paradis, Johanne, Elena Nicoladis e Fred Genesee. "Early emergence of structural constraints on code-mixing: evidence from French–English bilingual children". Bilingualism: Language and Cognition 3, n. 3 (dicembre 2000): 245–61. http://dx.doi.org/10.1017/s1366728900000365.
Zhang, Chenyao, Yuyan Han, Yuting Wang, Junqing Li e Kaizhou Gao. "A Distributed Blocking Flowshop Scheduling with Setup Times Using Multi-Factory Collaboration Iterated Greedy Algorithm". Mathematics 11, n. 3 (22 gennaio 2023): 581. http://dx.doi.org/10.3390/math11030581.
Kawal, Kevin, Steven Blair, Qiteng Hong e Panagiotis N. Papadopoulos. "Selective Auto-Reclosing of Mixed Circuits Based on Multi-Zone Differential Protection Principle and Distributed Sensing". Energies 16, n. 6 (8 marzo 2023): 2558. http://dx.doi.org/10.3390/en16062558.
Tesi sul tema "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.
Today’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
Capitoli di libri sul tema "Mixed blocking constraints":
Sauvey, Christophe, Nathalie Sauer e Wajdi Trabelsi. "Job-Shop Scheduling with Mixed Blocking Constraints between Operations". In 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.
Wang, Feng, Qingcheng Zhu, Xiaolong Li, Jiaming Gu, Zhenhua Yan, Xiaosong Yu e Yongli Zhao. "Spectrum Availability Aware Routing and Resource Allocation for Point-to-Multipoint Services in Mixed-Grid Optical Networks". In Proceedings of CECNet 2021. IOS Press, 2021. http://dx.doi.org/10.3233/faia210446.
Atti di convegni sul tema "Mixed blocking constraints":
Sauvey, Christophe, e Wajdi Trabelsi. "Hybrid job shop scheduling with mixed blocking constraints between operations". In 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA). IEEE, 2015. http://dx.doi.org/10.1109/etfa.2015.7301538.