In this paper, we consider a semi-on-line scheduling problem of two identical machines with common maintenance time interval and nonresumable availability. We prove a lower bound of 2.79129 on the competitive ratio and give an on-line algorithm with competitive ratio 2.79633 for this problem.

Purpose: The purpose of this paper is to empirically investigate the effects of cooperation history on contractual governance and the moderating effects of dependence asymmetry on those relationships from the perspective of a weaker firm in emergent economies. Drawing from resource dependence...

Purpose: This study aims to investigate how aspects of mobility affect social media advertising effectiveness (i.e. consumer purchase intention) on mobile platforms from the perspective of the fit-viability model. Design/methodology/approach: Data were collected through an online questionnaire...

Purpose: Due to interactive fluctuations during service encounters, fuzzy requests frequently occur from either frontline employees or customers. While such requests from customers have been drawn wide attention, there exists a lack of research on frontline employees’ fuzzy requests and...