New Algorithm for N-jobs on M-machine Flow Shop Scheduling Problems

Geleta Tadele Mohammed

doi:10.11648/j.acm.20160501.11

Abstract

Because of flow shop scheduling is one of the most important problems in the area of production management, In this paper, what I have did is that, I have developed a new algorithm for n-jobs m-machine flow shop scheduling problem for special case of n-jobs m-machine flow shop scheduling problem. And also, there is a good self explanatory example to explain the algorithm very well.

Highlights

Introduction and Statement of the ProblemIn this paper the -jobs -machines flow shop scheduling problem where processing times of all jobs are deterministic and known before processing is started is studied with the introduction of concepts of optimal value of processing time multiple, assignment of optimal due date and determination of optimal sequence of jobs by minimizing total squared values of lateness
It is natural to have minimization of total missed due dates as the objective, for which the total squared values of lateness is defined as the performance measure
The problem is to determine an optimal value of processing time multiple, assign due date and obtain optimal sequence of jobs which minimizes

Summary

Introduction and Statement of the Problem

In this paper the -jobs -machines flow shop scheduling problem where processing times of all jobs are deterministic and known before processing is started is studied with the introduction of concepts of optimal value of processing time multiple, assignment of optimal due date and determination of optimal sequence of jobs by minimizing total squared values of lateness. If and respectively denotes the lateness, completion time and assigned due date of the job in position , . We can use E.D.D (earliest due date) rule to obtain the optimum arrangement or sequence of jobs This is all about the work done by cheng on n-jobs 1-machine scheduling problem. The problem is to determine an optimal value of processing time multiple, assign due date and obtain optimal sequence of jobs which minimizes (total sum of squared values of lateness)

Formulation of Completion Time

Problem Formulation and Assumption

Optimal Due Date Assignment Procedure

Algorithms to Get Optimal Sequence