Abstract
|
Article Information:
On Heuristic Approach for Solution of Scheduling Problem Involving Transportation Time and Break-down Times for Three Machines
A. Khodadadi
Corresponding Author: A. Khodadadi
Submitted: November 13, 2012
Accepted: February 18, 2013
Published: April 05, 2014 |
Abstract:
|
In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles and conveyors and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are a finite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this study we study a new simple heuristic algorithm for a ‘3-machine, n-job’ flow shop scheduling problem in which transportation time and break down times of machines are considered. A heuristic approach method to find optimal and near optimal sequence minimizing the total elapsed time.
Key words: Break down time, flow-shop scheduling problem, optimal sequence, transportation time, , ,
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
A. Khodadadi, . On Heuristic Approach for Solution of Scheduling Problem Involving Transportation Time and Break-down Times for Three Machines. Research Journal of Applied Sciences, Engineering and Technology, (13): 2596-2598.
|
|
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|