Application of Johnson’s algorithm in processing jobs through two-machine system

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

synthesis of platinum nanostructures in two phase system

چکیده پلاتین، فلزی نجیب، پایدار و گران قیمت با خاصیت کاتالیزوری زیاد است که کاربرد های صنعتی فراوانی دارد. کمپلکس های پلاتین(ii) به عنوان دارو های ضد سرطان شناخته شدند و در شیمی درمانی بیماران سرطانی کاربرد دارند. خاصیت کاتالیزوری و عملکرد گزینشی پلاتین مستقیماً به اندازه و- شکل ماده ی پلاتینی بستگی دارد. بعضی از نانو ذرات فلزی در سطح مشترک مایع- مایع سنتز شده اند، اما نانو ساختار های پلاتین ب...

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...

متن کامل

A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times

Consider the problem of scheduling a set of tasks of length p without preemption on m identical machines with given release and deadline times. We present a new algorithm for computing the schedule with minimal completion times and makespan. The algorithm has time complexity O(min(1, p m )n 2) which improves substantially over the best known algorithm with complexity O(mn2). 1998 ACM Subject Cl...

متن کامل

Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System

This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mechanical and Energy Engineering

سال: 2020

ISSN: 2544-1671,2544-0780

DOI: 10.30464/jmee.2020.4.1.33