Documents disponibles écrits par cet auteur

Photodegradation of bisphenol A in the montmorillonite KSF suspended solutions / Y. X. Liu in Industrial & engineering chemistry research, Vol. 47 N°19 (Octobre 2008) 

Public ISBD [article]  in Industrial & engineering chemistry research > Vol. 47 N°19 (Octobre 2008) . - p. 7141–7146 Titre : Photodegradation of bisphenol A in the montmorillonite KSF suspended solutions Type de document : texte imprimé Auteurs : Y. X. Liu, Auteur ; X. Zhang, Auteur ; L. Guo, Auteur Année de publication : 2008 Article en page(s) : p. 7141–7146 Note générale : Chemical engineering Langues : Anglais (eng) Mots-clés : Montmorillonite  KSF  Heterogeneous  system  Bisphenol  A Résumé : The commercially available montmorillonite KSF is utilized as efficient acidic catalyst in organic synthesis chemistry. In this study it is used as a photoactive reagent in a heterogeneous system. A series of experiments of the degradation of bisphenol A (BPA) as a model organic pollutant in montmorillonite KSF suspended solutions under UV−vis irradiation (metal halide lamp, λ ≥ 365 nm) were investigated. It is found that BPA could be effectively photodegraded in suspension. The BPA photodegradation is dependent on the pH of the solution and dosage of clay minerals, and it is more effective for BPA to be degraded at pH 4; the degradation rate of BPA increased with the concentration of clays in the range of 0.5 g/L to 5 g/L. The photodegradation rate of BPA is fitted well into the Langmuir−Hinshelwood equation. Results also indicate that the carboxylate and dissolved oxygen could efficiently enhance the degradation rate, and the role of carboxylate in accelerating the photodegradation of BPA follows the order: pyruvate > oxalate > citrate. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800169c [article] Photodegradation of bisphenol A in the montmorillonite KSF suspended solutions [texte imprimé] / Y. X. Liu, Auteur ; X. Zhang, Auteur ; L. Guo, Auteur . - 2008 . - p. 7141–7146. Chemical engineering Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 47 N°19 (Octobre 2008) . - p. 7141–7146 Mots-clés : Montmorillonite  KSF  Heterogeneous  system  Bisphenol  A Résumé : The commercially available montmorillonite KSF is utilized as efficient acidic catalyst in organic synthesis chemistry. In this study it is used as a photoactive reagent in a heterogeneous system. A series of experiments of the degradation of bisphenol A (BPA) as a model organic pollutant in montmorillonite KSF suspended solutions under UV−vis irradiation (metal halide lamp, λ ≥ 365 nm) were investigated. It is found that BPA could be effectively photodegraded in suspension. The BPA photodegradation is dependent on the pH of the solution and dosage of clay minerals, and it is more effective for BPA to be degraded at pH 4; the degradation rate of BPA increased with the concentration of clays in the range of 0.5 g/L to 5 g/L. The photodegradation rate of BPA is fitted well into the Langmuir−Hinshelwood equation. Results also indicate that the carboxylate and dissolved oxygen could efficiently enhance the degradation rate, and the role of carboxylate in accelerating the photodegradation of BPA follows the order: pyruvate > oxalate > citrate. En ligne : http://pubs.acs.org/doi/abs/10.1021/ie800169c

Scheduling an unbounded batching machine with family jobs and setup times / R. Zheng in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 160–167 Titre : Scheduling an unbounded batching machine with family jobs and setup times Type de document : texte imprimé Auteurs : R. Zheng, Auteur ; H. Li, Auteur ; X. Zhang, Auteur Année de publication : 2012 Article en page(s) : pp. 160–167 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Batching  machine  Family  jobs  Setup  times  Dynamic  programming Index. décimale : 001.424 Résumé : We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different families. For a fixed number of families m, we present a generic forward dynamic programming algorithm that solves the problem of minimizing an arbitrary regular cost function in pseudopolynomial time. We also present a polynomial-time backward dynamic programming algorithm with time complexity O (mn(n/m+1)m) for minimizing any additive regular minsum objective function and any incremental regular minmax objective function. The effectiveness of our dynamic programming algorithm is shown by computational experiments based on the scheduling of the heat-treating process in a steel manufacturing plant. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010187a.html [article] Scheduling an unbounded batching machine with family jobs and setup times [texte imprimé] / R. Zheng, Auteur ; H. Li, Auteur ; X. Zhang, Auteur . - 2012 . - pp. 160–167. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 160–167 Mots-clés : Scheduling  Batching  machine  Family  jobs  Setup  times  Dynamic  programming Index. décimale : 001.424 Résumé : We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different families. For a fixed number of families m, we present a generic forward dynamic programming algorithm that solves the problem of minimizing an arbitrary regular cost function in pseudopolynomial time. We also present a polynomial-time backward dynamic programming algorithm with time complexity O (mn(n/m+1)m) for minimizing any additive regular minsum objective function and any incremental regular minmax objective function. The effectiveness of our dynamic programming algorithm is shown by computational experiments based on the scheduling of the heat-treating process in a steel manufacturing plant. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors2010187a.html