selecting an appropriate manufacturing machine is a very important and complex problem for firms, which usually have to deal with both qualitative and quantitative criteria. taking into account the differences among machines in terms of cost, speed, quality and after sale services, type and number of machines are important parameters to consider. therefore, the goal of this paper is to propose ...

The learning effects are widely studied in scheduling problems recently. Biskup [1] classified the learning effect models into two diverse approaches, namely the position -based and the sum-of-processing-time-based learning effect models. He further claimed that the position-based learning effect model seems to be a realistic assumption for the case that the actual processing of the job is main...

This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (Lmax). A two-step neighborhood search procedure ...

The paper addresses the scheduling of a single machine with tool changes in order to minimize total completion time. A constraint-based model is proposed that makes use of global constraints and also incorporates various dominance rules. With these techniques, our constraint-based approach outperforms previous exact

We give a (2 + ǫ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]