An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal setup times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness. Cheng and Kovalyov [l] introduced the following due date assignment and scheduling problem. There are n groups of jobs to be scheduled for processing...

This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...

This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into lots, on identical machines, with objectives to reduce job total throughput time and to improve machine utilization. A genetic algorithm is developed, whose fitness function evaluates the load-balancing in the generate...

We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost funct...

In the previous chapter, we have made an analytical study regarding the completion time and the due time of each job, in order to find out the satisfaction level of demand maker in a flow shop scheduling. But this chapter differs in the study that here each job has to process on equi potential parallel machines at first stage and then on other succeeding machines in a specified order. Some addi...

This paper considers the problem of scheduling n jobs on a single machine. A fixed processing time and an execution interval are associated with each job. Preemption is not allowed. The objective is to find a feasible job sequence that minimizes the number of tardy jobs. On the basis of an original mathematical integer programming formulation, this paper shows how both good-quality lower and up...

This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...

We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...