We study multitasking scheduling and due-window assignment problems in a single machine, which can be found various application domains. In environment, unfinished job always interrupts in-processing job. common due window assignment, the aim is to find optimal minimise value of earliness tardiness penalty. this paper, we two problems, where objective first problem earliness, tardiness, startin...

In this paper, we present a genetic algorithm approach that considers the single machine scheduling problem. There are n jobs, in which each job j ( 1 2 j n = , ,..., ) has a normal processing time j p , a due date j d , earliness penalty j α , and tardiness penalty j β . The objective is to find the sequence of jobs that minimizes the weighted sum of earliness and tardiness penalty costs, with...

We consider a special class of resource-constrained single machine scheduling problems. In the classical context, resource types are classified into renewable and non-renewable; however, large variety real-world problems may not fit one these classes, e.g. labour regulations in project scheduling, budget allocation to different phases construction project, dose management medical imaging centre...

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...

In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime criteria. We introduce two intensification pr...

The High-Variety, Low-Volume (HVLV) scheduling problem is one of the most arduous combinatorial optimization problems. This paper considers an interesting formulation of the HVLV scheduling problem using (max, +) algebra while periodic Preventive Maintenance (PM) is considered. Maintenance is time based since activities are periodically fixed: maintenance is required after a periodic time inter...