Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

Many real-world applications require varying costs for different types of misclassification errors. Such a cost-sensitive classification setup can be very different from the regular classification one, especially in the multiclass case. Thus, traditional meta-algorithms for regular multiclass classification, such as the popular one-versus-one approach, may not always work well under the cost-se...

In this paper we derive a new structural property for an optimal solution of the economic lot-sizing problem with time-invariant cost parameters. We show that the total holding cost in an order interval of an optimal solution is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. Since we can also show that this bound is ti...

Setup planning is a set of activities used to arrange manufacturing features into an appropriate sequence for processing. It has significant impacts on the product quality, which is often measured in terms of dimensional variation in the Key Product Characteristics (KPC). Current approaches to setup planning are experience-based and tend to be conservative by selecting unnecessarily precise mac...

We consider an infinite-horizon deterministic joint replenishment problem with first order interaction. Under this model, the setup transportation/reorder cost associated with a group of retailers placing an order at the same time equals some group-independent major setup cost plus retailer-dependent minor setup costs. In addition, each retailer is associated with a retailer-dependent holding-c...

We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and general setup time distribution. The objective is to minimize the expected holding cost due to the waiting of jobs. A setup time is required to switch from one queue to another. We provide a ...