Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Flexible Flow Shop Scheduling (FFS)

Chapter 18
Handbook of Research on Novel Soft Computing Intelligent Algorithms: Theory and Practical Applications
An FFS scheduling problem is related to a group of parallel machines arranged into a number of stages in series. At each stage, there are number of identical machines in parallel. Each job has not to be processed at each stage and it can ignore one or more stages. Each machine can process at most one job at a time.
Published in Chapter:
Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates
Maryam Ashrafi (Amirkabir University of Technology, Iran), Hamid Davoudpour (Amirkabir University of Technology, Iran), and Mohammad Abbassi (Institute for Trade Studies and Research, Iran)
Copyright: © 2014 |Pages: 30
DOI: 10.4018/978-1-4666-4450-2.ch018
Abstract
This chapter deals with a hybrid flow shop scheduling problem involving sequence dependent setup times, commonly known as the SDST hybrid flow shop, and each stage (work centre) consists of parallel identical machines. In this problem, each job has a different release date and consists of ordered operations that must be processed on machines from different centers in the same order. In addition, the processing times of operations on some machine centers may vary between a minimum and a maximum value depending on the use of a continuously divisible resource. We consider a non-regular optimization criterion based on due dates which are not a priori given or fixed but can be assigned by a decision-maker. A due date assignment cost is also included into the objective function. Finally, the results obtained through the use of GRASP (Greedy Randomized Adaptive Search Procedure) are compared with those computed by SA (Simulated Annealing).
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR