In the process industry, both quality and consistency of mid-term planning and short-term scheduling are crucial. We propose a sequential approach consisting in three steps : planning, lot streaming-pegging, and scheduling. This paper focuses on the intermediate problem that consists in cutting up the planned production in several lots (lot streaming) and linking stocks, lots and demands by det...

Efficient and dynamic resources scheduling algorithms are needed to harness the hidden power of a Grid System. In this work, a few economic scheduling algorithms have been proposed. First, Grid system is modeled using a vector space approach. Then, a cost function for the operation has been defined. Using the model and cost function defined, a few new economic scheduling algorithms have been pr...

Nowadays multiprocessor system has received a lot of attention because of its efficiency and reliability, which play an important role in success of multiprocessor systems. Hence, there is a necessity for developing efficient scheduling algorithms. Therefore, various researches have been done in different areas of scheduling of multiprocessor system. This paper evaluates the performance of homo...

This paper focuses on production scheduling in a semiconductor wafer fab producing multiple product types that have different due dates and different process flows. In the wafer fab, wafer lots are processed on serial and batch processing workstations, each of which consists of parallel identical machines. Machines in serial processing workstations process wafer lots one by one, while those in ...

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

The time continuous integrated multi-item capacitated dynamic scheduling model with non-granular lot sizes and lot start times and dynamic demand functions as its key elements has recently been developed by Jodlbauer. Here we present a reformulation for improved ease of handling as well as several methods to obtain schedules close to the optimum.

A hybrid genetic algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion t imes from due dates.