A note on reverse scheduling with maximum lateness objective

The inverse and reverse counterparts of the single-machine scheduling problem 1||Lmax are studied in [2], in which the complexity classification is provided for various combinations of adjustable parameters (due dates and processing times) and for five different types of norm: ℓ1,ℓ2,ℓ∞,ℓΣH , and ℓmaxH . It appears that the O(n2) -time algorithm for the reverse problem with adjustable due dates contains a flaw. In this note, we present the structural properties of the reverse model, establishing a link with the forward scheduling problem with due dates and deadlines. For the four norms ℓ1,ℓ∞,ℓΣH , and ℓmaxH , the complexity results are derived based on the properties of the corresponding forward problems, while the case of the norm ℓ2 is treated separately. As a by-product, we resolve an open question on the complexity of problem 1||∑αjT2j

Online Personal Selling, Need for Touch and e-Loyalty

This research examines the relationship between online website quality (eTailQ) and e-loyalty by examining (a) the mediating role of need for touch (NFT) and (b) the moderating role of online personal selling influencing the mediation. Non-probability criterion-based purposive sampling resulted 346 participants participating in this research. Results show that NFT mediates the relationship between eTailQ and e-loyalty. Moderated mediation reveals that the indirect pathways (NFT) through which eTailQ exerts its effect on e-loyalty is dependent on the value of real-time online personal selling of the website. Managerially, the study explains quality of website is effective to enhance consumer loyalty when online retailers provide ways to reduce NFT in their website and that personal selling seem to moderate the likelihood of repeat purchase