Author of the publication

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.

, , , and . Oper. Res. Lett., 31 (3): 323-326 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

NHPP models with Markov switching for software reliability, , and . Computational Statistics & Data Analysis, 52 (8): 3988--3999 (Apr 15, 2008)Semi-online scheduling with bounded job sizes on two uniform machines., and . Theor. Comput. Sci., (2016)Hardware Design of Sphere Decoding for MIMO Systems., , and . SoCC, page 287-290. IEEE, (2005)Computation of gas-solid flows by finite difference Boltzmann equation., , , and . Appl. Math. Comput., 173 (1): 33-49 (2006)Single machine scheduling to minimize total weighted tardiness., , , and . Eur. J. Oper. Res., 165 (2): 423-443 (2005)ImageCLEF2020: Laterality-Reduction Three-Dimensional CBAM-Resnet with Balanced Sampler for Multi-Binary Classification of Tuberculosis and CT Auto Reports., , , , , and . CLEF (Working Notes), volume 2696 of CEUR Workshop Proceedings, CEUR-WS.org, (2020)Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants., , and . COCOON, volume 13595 of Lecture Notes in Computer Science, page 36-48. Springer, (2022)New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems., , and . AAIM, volume 11343 of Lecture Notes in Computer Science, page 221-232. Springer, (2018)EasyCache: a transparent in-memory data caching approach for internetware., , , , and . Internetware, page 35-44. ACM, (2014)Distance Constrained Vehicle Routing Problem to Minimize the Total Cost., , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 639-650. Springer, (2019)