We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem with common due date assignment and a convex resource consumption function. We provide a bicriter...

We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.

Today’s company competiveness is favoured by product customisation and fast delivery. A strategy to meet this challenge is to manufacture standard items to stock for product customisation. This configures a hybrid environment of make-to-stock and make-to-order. To explore the advantages of this requires good understanding of production control. Thus, we study production under hybrid MTS-MTO, or...

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 deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...

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

front of the batch processor, where they wait to be processed. The batch processor has a finite capacity Q, and the processing time is independent of the number of jobs loaded into the batch processor. In certain manufacturing systems (including semiconductor wafer fabrication), a processing time window exists from the time the job exits the feeder processor till the time it enters the batch pr...