This paper describes a constraint programming approach to solving a scheduling problem with earliness and tardiness cost using a problem specific search procedure. The presented algorithm is tested on a set of randomly generated instances of the job shop scheduling problem with earliness and tardiness costs. The experiments are executed also for three other algorithms, and the results are then ...

A new type of tardy cost, called stepwise tardiness, is considered in a single machine problem. The stepwise tardiness scheduling has been found in many practical situations. To the best of our knowledge, there exist few studies directly addressing the problem. In this paper, we develop a heuristic for the single machine total stepwise tardiness (SMTST) problem. In addition, a variable neighbor...

This paper investigates the single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times simultaneously. The scheduler has option of job-rejection, i.e., some jobs are processed other rejected. Under three (i.e., common, slack different) methods, our goal is to minimize sum a general earliness-tardiness cost weighted earliness-tardiness...

The traditional focus of scheduling research is on finding schedules with a low implementation cost. However, in many real world scheduling applications finding a robust or flexible schedule is just as important. A robust schedule is a quality schedule expected to still be acceptable if something unforeseen happens, while a flexible schedule is a quality schedule expected to be easy to change. ...

In this paper we consider single machine scheduling problems with a common due-date for all jobs, arbitrary monotone earliness and tardiness costs and arbitrary breakdown and repair processes. We show that the problem is equivalent to a deterministic one without breakdowns and repairs and with an equivalent cost function of a job's completion time. A V-shaped schedule without idle times is show...

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent asymmetric earliness tardiness unit costs. scheduler may process only subset of the jobs, i.e. option job-rejection is allowed. objective function consists three cost components: total earliness-tardiness all scheduled due-date, rejection cos...

We consider a single-machine scheduling problem with upper bounded actual processing time and upper bounded maintenance time under deteriorating effect.The actual processing time of a job is a position-dependent power function. If the actual processing time of a job exceeds the upper bound, tardiness penalty of the job should be paid. And if the maintenance time exceeds the corresponding upper ...