Computational Intelligence Approach for Flow Shop Scheduling Problem

Computational Intelligence Approach for Flow Shop Scheduling Problem

Harendra Kumar (Gurukula Kangri University, India)
DOI: 10.4018/978-1-5225-2990-3.ch013
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Flow shop scheduling is an important tool for manufacturing and engineering, where it can have a major impact on the productivity of a process. Because the resources used in manufacturing activities are very limited, flow shop scheduling becomes a very important concept in managerial decision-making. It deals with the allocation of resources to tasks over given time periods with a view to optimize one or more objective functions like makespan or mean tardiness resulting in reduced production time and costs. During recent years, effective computational intelligent algorithms are developed and successfully employed for achieving the optimum output of the flow shop problems. This chapter provides a computational intelligence approach for flow shop scheduling.
Chapter Preview
Top

Introduction

The present industrial environment is characterized by markets facing competition from which customer requirements and expectations are becoming increasingly high in terms of quality, cost and delivery times. This evolution is made stronger by rapid development of new information and communication technologies which provide a direct connection between industries and customers. To sustain in the current competitive environment, it is essential for the manufacturing firms to improve the schedule based on simultaneous optimization of performance measures such as makespan, flow time and tardiness. Since all the scheduling criteria are important from business operation point of view, it is vital to optimize all the objectives simultaneously instead of a single objective. The schedules must meet the deadline committed to customers because failure to do so may result in a significant loss of goodwill. Scheduling is a process by which limited resources are assigned over time among parallel or sequential activities. Such situations are found routinely in factories, publishing houses, shipping, hospitals, airports etc. Good scheduling algorithms can lower the production cost in a manufacturing process so as to enable the company to remain competitive. A variety of scheduling algorithms have been developed over the past several years to address different production systems. Each scheduling algorithm appears to have some advantages as well as disadvantages.

Complete Chapter List

Search this Book:
Reset