We consider the problem of scheduling n groups of jobs on a single machine where three types of decisions are combined: scheduling, batching and due-date assignment. Each group includes identical jobs and may be split into batches; jobs within each batch are processed jointly. A sequence independent machine set-up time is needed between each two consecutively scheduled batches of different grou...

This paper studies a general two-stage scheduling problem, in which jobs of different importance are processed by one first-stage processor and then, in the second stage, the completed jobs need to be batch delivered to various pre-specified destinations in one of a number of available transportation modes. Our objective is to minimize the sum of weighted job delivery time and total transportat...

The di0usion step in semiconductor wafer fabrication is very time consuming, compared to other steps in the process, and performance in this area has a signi1cant impact on overall factory performance. Di0usion furnaces are able to process multiple lots of similar wafers at a time, and are therefore appropriately modeled as batch processing machines with incompatible job families. Due to the im...

In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...

Job scheduling and resource management plays an essential role in high-performance computing. Supercomputing resources are usually managed by a batch system, which is responsible for the effective mapping of jobs onto resources (i.e., compute nodes). From the system perspective, a batch system must ensure high system utilization and throughput, while from the user perspective it must ensure fas...

Traditional batch job schedulers are a poor fit for a grid computing environment. In order to respond to the grid scheduling challenges, the client must perform planning. In this paper, we expound upon the differences between planning versus scheduling, and present two grid projects which utilize a ClassAd matchmaking framework to enable planning on the grid. Planning for purposes of job placem...

Even though a very large number of solution methods has been developed for the jobshop scheduling problem, the majority are designed for the makespan criterion. In this paper, we propose a general approach for optimizing any regular criterion in the job-shop scheduling problem. The approach is a local search method that uses a disjunctive graph model and neighborhoods generated by swapping crit...

Consider a single machine and a set of jobs that are available for processing at time 0. Job has a processing time , a due date and a weight . We consider bi-criteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NPhardness proofs for the scheduling problems when either one of the two criteria is the primary criterion and the other one is the...

This article deals with a quite complex machine scheduling problem comprising the following features: 1. unrelated parallel machines; 2. jobs have different due dates; 3. job splitting is allowed; 4. setup times are sequence dependent; 5. the objective function is to minimize the weighted sum of early, tardy and setup costs. The problem is formulated as a mixed-integer programming model which i...