Production scheduling is the process of allocating the resources and then sequencing of task to produce goods. Allocation and sequencing decision are closely related and it is very difficult to model mathematical interaction between them. The allocation problem is solved first and its results are supplied as inputs to the sequencing problem. High quality scheduling improves the delivery perform...

Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...

HIS work is motivated by the scheduling problem of a real world single machine production encountered in a metal industry. The objective function to consider is the minimization of mean tardiness and flow time. This problem belongs to the class of difficult problems (NP-complete). Due to the dynamic and the difficulty for searching the solution, deterministic searching methods do not work effec...

The purpose of this study is to develop an effective scheduling methodology for a realistic flow shop sequencing problem. The flow shop consists of two machines where only the first machine has separable, external, and sequence dependent setup times. The length of setup times required for a job depends not on the immediately preceding job but on the job which is two steps prior to it. The probl...

The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve production multiple products with different processing routes short life cycles, which prevents obtaining deterministic setup times. Likewise, several industries present restrictions when changing from one reference to another in system, incurring variable sequence-dependent ...

FLEXIBLE SCHEDULING IN MIDDLEWARE FOR DISTRIBUTED RATE-BASED REAL-TIME APPLICATIONS by Christopher D. Gill ADVISOR: Dr. Ron K. Cytron and Dr. Douglas C. Schmidt May, 2002 Saint Louis, Missouri Distributed rate-based real-time systems, such as process control and avionics mission computing systems, have traditionally been scheduled statically. Static scheduling provides assurance of schedulabili...

Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-con...

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...