This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as “makespan”. This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator’s experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

Processing mail objects in a mail processing center involves several steps and operations, in particular dispatching as well as sorting by destination. The purpose of this paper is to present a model for the part-time worker staffing and allocation proble

This paper deals with a batch processor model in which the batch processing speed depends on the jobs assigned to the batch. Each job is completed by accomplishing its required job processing quantity which is calculated as job speed product processing time. Its speed is given as not the exact value but the range. Thus the batch sets are constructed by the jobs which hold the speed in common. And the batch sets are processed as soon as possible. We developed the model to described the problem situation and adopt the total tardiness as the decision criterion.

This study presents the new dispatching rules of job shop scheduling with unbalanced machine workloads to decrease mean flow time and mean tardiness. The proposed dispatching rules consider the information related to work remaining, modified job due dates, modified operation due dates and machine workload. The performance of the new dispatching rules is compared and analyzed with the existing rules through the computer simulation at different levels of workload imbalanced. The results can be useful to the researchers and practitioners of job shop scheduling with unbalanced machine workloads.

A study is for the approach that we could reduce the logistics costs through uprising the efficiency, complying to the demand in time, stock management based on the general production plan in the point of SCM. We will take following steps to get the goal. First, we will overview the physical distribution expenses annually. Second, will find the main cause of optimal load loss by improper container and lack of delivery flexibility to the demand. Third, the goal will be inferred through the fast information share based on organic relationship, the establishment of general production plan, the improvement of stock management plan. By way of this process, it can be accomplished expense reduction as well as flexible establishment of the reduction of worker's load.

This study presents the new dispatching rules of job shop scheduling with unbalanced machine workloads to decrease mean flow time and mean tardiness. The proposed dispatching rules consider the information related to work remaining, modified job due dates, modified operation due dates and machine workload. The performance of the new dispatching rules is compared and analyzed with the existing rules through the computer simulation at different levels of workload imbalanced. The results can be useful to the researchers and practitioners of job shop scheduling with unbalanced machine workloads.

A study is for the approach that we could reduce the logistics costs through uprising the efficiency, complying to the demand in time, stock management based on the general production plan in the point of SCM. We will take following steps to get the goal. First, we will overview the physical distribution expenses annually. Second, will find the main cause of optimal load loss by improper container and lack of delivery flexibility to the demand. Third, the goal will be inferred through the fast information share based on organic relationship, the establishment of general production plan, the improvement of stock management plan. By way of this process, it can be accomplished expense reduction as well as flexible establishment of the reduction of worker's load.

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and duedates. The proposed dispatching rules consider the information of total work remaining and machine utilization to decrease mean flowtime and mean tardiness. The results of computer experiments show that those schedule performances are significantly improved by using the new dispatching rules. The results provide guidance for the researchers and practitioners of auxiliary resource constrained job shop scheduling to decrease mean flowtime and mean tardiness.

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors at a time. The problem is to find a schedule of minimal time to complete all tasks. In this paper, a tabu search is presented. Numerical results show that tabu search yields a better performance than the previous studies.

This paper deals with the problem of batching and scheduling of jobs whose processing times are different respectively. But, they are given as not the exact value but the range from the lower limits to the upper, which makes it possible to group jobs into

This paper deals with the problem of batching and scheduling of jobs whose processing times are given as the duration from the lower limits to the upper, which makes it possible to group jobs into batches. The grouping of jobs is desirable because of the capability of the batch processor to accommodate several jobs at once. The time required to process the jobs in any batch depends on their lower limit processing times. Once processing is initiated on a batch processor, the batch cannot be interrupted, nor can other jobs be started. And all jobs are assumed to be simultaneously available. This paper develops the model to describe these situation and a heuristic method to minimize its total tardiness.

Change in manufacturing systems are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic industrial environments is very complex. The main concept of This dissertation is to continuously monitor a manufacturing system' status(RPJ, RLJ, RSDJ, JIT) and detect or predict a change so that scheduling system will react by Modifying production schedule(dispaching rule) to lessen the effects of this change.