Though many of the previous studies have been devoted to internal due date assignment in a wafer fabrication factory (wafer fab), very few among them considered the allowance added to a completion time forecast. In this way, the probability of on-time delivery is only about 50%. Methods based on confidence intervals generate completion time forecasts with very wide ranges and are not practical....

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

Scheduliig strategies for multiprocessor DSP are classified into four types: fully-dynamic, static-assignment, self-timed, and fully-static. The concept of static scheduling (self-timed or fullystatic) is extended to handle non-deterministic actors in the proposed quasi-static scheduling. Quasi-static scheduling minimizes run-time overhead with increased compilation complexity, thus adequate fo...

In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The cost for each job consists of four components: earliness, tardiness, window location and window size. The objective is to schedule the jobs and to assign the maintenance activity and due-windows s...

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

This paper describes and evaluates operating system support for on-line scheduling of real-time tasks on shared memory multiprocessors. The contributions of this work include: (1) the design and implementation of an eecient on-line scheduler that can execute a variety of policies addressing both the assignment of real-time tasks to processors and the scheduling of tasks on individual processors...

The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...

When solving scheduling problems a crucial task is the selection or creation of the appropriate scheduling algorithm. An approach is presented that combines the use of meta-scheduling knowledge to select the appropriate strategy and the use of dynamic scheduling knowledge for the flexible creation of scheduling algorithms. The method is based on the decomposition of scheduling algorithms into t...

This study attempts to enhance the responsiveness of enterprises by adjusting the delivery dates taking into account of the production and delivery schedules in a supply chain. To enhance responsiveness, we suggest a due-date assignment method and re-negotiation process for a sales order processing system. The due-date assignment method is designed with the concept of categorized customers’ pri...