I've made my share of errors, some of which are detected only after publication. Here is a list of some that I am aware of; please let me know if you detect others

• Sanjoy Baruah, Marko Bertogna, and Giorgio Buttazzo. Multiprocessor scheduling for real-time systems. Springer. 2014

  The numbering scheme in the bibliography contains multiple errors; Tadeus Prastowo has compiled a list of these errors in the following technical report.

  Multiprocessor Scheduling for Real-Time Systems: Errata

• Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, and Leen Stougie. Scheduling real-time mixed-criticality jobs. IEEE Transactions on Computers 61 (8), pp 1140-1152, 2012

  Thanks to Rany Kahlil for having identified an error in Lemma 2 of this paper.

  This erratum corrects this and some other errors.

• Sanjoy Baruah. Task assignment on two unrelated types of processors. Proceedings of the 17th International Conference on Real-Time and Network Systems (RTNS), Nantes, France. October, 2011.

  Thanks to Gurulingesh Raravi for informing me of some errors in this paper.

  A corrected (and far more general) version of the results appear in (Andreas Wiese, Vincenzo Bonifaci, and Sanjoy Baruah. Partitioned EDF scheduling on a few types of unrelated multiprocessors, Real-Time Systems 49 (2), pp 219-238, 2013.)

• Sanjoy Baruah. An improved global EDF schedulability test for uniform multiprocessors. Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS), Stockholm, Sweden. April 2010. IEEE Computer Society Press.

  Thanks to Haitao Zhu for pointing this out

  In the appendix, it is claimed (bullet item 4):
  For a deadline miss to occur, it is necessary that ${\cal L }> {\cal U}$; hence ${\cal L} \leq {\cal U}$ is a sufficient schedulability condition.
  This is incorrect; the correct statement is
  For a deadline miss to occur, it is necessary that ${\cal L }< {\cal U}$; hence ${\cal L} \geq {\cal U}$ is a sufficient schedulability condition.

• Sanjoy Baruah. Preemptive uniprocessor scheduling of non-cyclic GMF task systems. Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), Macau, China. August 2010. IEEE Computer Society Press.

  Figure 1 in this paper incorrectly claims that the non-cyclic GMF task model is a generalization of the "traditional" GMF model. This is incorrect; a corrected version of this figure appears in (Sanjoy Baruah. The non-cyclic recurring real-time task model. Proceedings of the IEEE Real-Time Systems Symposium (RTSS), San Diego, CA. December 2010. IEEE Computer Society Press.)

• Sanjoy Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller. Implementation of a speedup-optimal global EDF schedulability test. Proceedings of the EuroMicro Conference on Real-Time Systems, Dublin, Ireland. July 2009. IEEE Computer Society Press.

  Thanks to Marko Bertogna for catching this

  Claim 5 in the paper is incorrect as stated (although this error is not relevant to the remainder of the paper). The corrected version of this claim may be found in the journalization of this paper (Sanjoy Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, and Sebastian Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems 46 (1), 2010.)

• Sanjoy Baruah. Techniques for Multiprocessor Global Schedulability Analysis. Proceedings of the Real-Time Systems Symposium, Tucson, AZ. December 2007. IEEE Computer Society Press.

  Thanks to Marko Bertogna for pointing this out

  Equation 3 is incorrect. The second term in the min -- $A_k + D_k - C_k$ -- implicitly assumes that the job missing its deadline executes for $C_k$ time units, whereas it actually executes for strictly less than $C_k$. Hence this second term should be -- $A_k + D_k - (C_k-\epxilon)$; for task systems with integer parameters, $\epsilon$ can be taken to be equal to one.
  (A similar modification needs to be made for the definition of $I_2(\tau)$ -- Equation 5 in the paper)

• Sanjoy Baruah and Joel Goossens. Scheduling Real-time Tasks: Algorithms and Complexity. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Joseph Y-T Leung (ed). Chapman Hall/ CRC Press. 2004.

  Thanks to Gennady Shmonin for pointing this out

  In the proof of Theorem 11, $d_i = p_i = 1$ should be $d_i = p_i = y_i$