We consider an M/G/∞ model with exponentially distributed setup times. Arrivals result in an off server starting a setup. Upon completing a setup, a server begins serving a waiting customer. Upon completing service, with probability p the server becomes eligible to serve another waiting customer. Among other things, we show, in steady state, that the number of busy servers is Poisson distribute...

This paper introduces and compares several formulations of a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The setup time is divided into two parts: one that can be performed at any time and another one that is restricted to be made outside of a given time interval. As a result, the setup time between two jobs is a function of the comp...

This paper proposes a novel disruptive innovation-like algorithm (DILA) for the problem of scheduling single machine with sequence-dependent family setup times to minimize total tardiness. The proposed is derived from Christensen’s (1997) theory innovation. Based on this theory, DILA proposed, which first generates two initial populations: mainstream market population and emerging population. T...

Setup operations play an important role in many production environments. In this paper, the exact modeling of setup times is motivated and two mixed integer programming model formulations are proposed. These model formulations allow the representation of ‘‘long’’ setup times with respect to the length of a planning period, which are widespread in process industries. Computational results unders...