This paper is concerned with Batch Scheduling in job-shop like manufacturing systems. The Horizontal Scheduling approach is used, assuming that full scheduling of a simple or complex job, based on the job routing network of operations, from the first operation to the last, is performed before another job is considered for scheduling, having in consideration existing manufacturing processors and...

In Grid computing, the dominating paradigm is batch processing. Grid middleware ships with batch-job support only, while lacking support for interactive applications. The reason is that grid middleware was developed for compute intensive jobs, which may run for a long time before a result becomes available. This leads to a “post-mortem” approach of analysing the output, possibly resulting in a ...

This paper develops Order Acceptance for an Integrated Production-Distribution Problem in which Batch Delivery is implemented. The aim of this problem is to coordinate: (1) rejecting some of the orders (2) production scheduling of the accepted orders and (3) batch delivery to maximize Total Net Profit. A Mixed Integer Programming is proposed for the problem. In addition, a hybrid meta-heuristic...

Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery, reduce work-in-process inventory, cut lead time, and improve machine utilization. Motivated by the extensive use of batch machines in manufacturing industries, the scheduling of job shops with batch machines is studied in this paper. Unlike machines that can process one part at a time (...

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

Customer order acceptance is an important process in make-to-order industries. Acceptance policies should operate such that a pre-specified delivery reliability is achieved, while maximizing resource utilization. By selecting orders with specific characteristics that maximize resource utilization, an important and often unforeseen effect occurs: the mix of orders changes such that the expected ...

This article addresses resource allocation scheduling problems with slack due window on a single machine. Linear and convex are considered. Our goal is to determine the optimal schedule, window, allocation, minimizing various objective functions respect criteria (position-dependent weights number of early jobs, tardy starting time, size) consumption function. For linear problem, we study two ca...

A hybrid Constraint Programming (CP) formulation able to address the multi-stage batch scheduling problem is presented. This approach handles different features found in industrial environments such as finite unit ready-times, dissimilar parallel equipment in each stage, sequence-dependent changeover times, topology constraints, forbidden job-equipment assignments, etc. Moreover, it renders goo...

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...