in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...

We consider scheduling on an unreliable machine that may experience unexpected changes in processing speed or even full breakdowns. We aim for a universal solution that performs well without adaptation for any possible machine behavior. For the objective of minimizing the total weighted completion time, we design a polynomial time deterministic algorithm that finds a universal scheduling sequen...

We develop algorithms for a single machine stochastic appointment sequencing and scheduling problem with waiting time, idle time, and overtime costs. This is a basic stochastic scheduling problem that has been studied in various forms by several previous authors. Applications for this problem cited previously include scheduling of surgeries in an operating room (Denton, 2007, Denton and Gupta,2...

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...