Erratum to “Single-machine scheduling problems with both deteriorating jobs and learning effects” [Appl. Math. Modell. 34 (2010) 2831–2839]

The aim of this paper is to show by counterexamples that Theorems 3–10 and Corollaries 2–5 in Wang et al. [Appl. Math. Model. 34 (2010) 2831–2839] are incorrect.     

Erratum to “Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects” [Appl. Math. Modell. 35 (2011) 1388–1395]

The aim of this paper is to show by a counterexample that Theorem 7 and Corollary 8 in Wang and Li [Appl. Math. Modell. 35 (2011) 1388–1395.] are incorrect.     

Erratum to “Fuzzy rough set model on two different universes and its application” [Appl. Math. Model. 35 (4) (2011) 1798–1809]

The aim of this paper is to correct two mistakes in [Appl. Math. Model. 35 (4) (2011) 1798–1809], which are: one of the properties of fuzzy rough set between two different universes and the definition of the upper approximation with the property for degree fuzzy rough set between two different universes.     

Erratum to “A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling” [Appl. Math. Modell. 34 (2010) 655–670]

This study analyzes Mixed Integer Linear Program (MILP) proposed by G. Kannan, P. Sasikumar M. Devika, (2010) in their paper titled ‘A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling’, Applied Mathematical Modelling, (34, 655–670). The model in Kannan et al. (2010) is found to be inadequate for the problem described. It is erroneous/infeasible in terms of constraints, objective and variables. In this work, we list down the flaws in the published work and propose modifications to rectify the flaws. The revised model is presented and illustrated using hypothetical problems.     

Corrigendum to “The envelope theorem for multiobjective convex programming via contingent derivatives” [J. Math. Anal. Appl. 372 (1) (2010) 197–207]

The aim of this note is to formulate an envelope theorem for vector convex programs. This version corrects an earlier work, “The envelope theorem for multiobjective convex programming via contingent derivatives” by Jiménez Guerra et al. (2010) [3]. We first propose a necessary and sufficient condition allowing to restate the main result proved in the alluded paper. Second, we introduce a new Lagrange multiplier in order to obtain an envelope theorem avoiding the aforementioned error.