Library Subscription: Guest
Begell Digital Portal Begell Digital Library eBooks Journals References & Proceedings Research Collections
Hybrid Methods in Engineering

ISSN Print: 1099-2391
ISSN Online: 2641-7359

Archives: Volume 1, 1999 to Volume 4, 2002

Hybrid Methods in Engineering

DOI: 10.1615/HybMethEng.v3.i1.60
13 pages

SOLVING FLEXIBLE FLOW SHOP PROBLEMS BY COMBINING LPT AND GUPTA SCHEDULING ALGORITHMS

Tzung-Pei Hong
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R. O. C.
Chan-Lon Wang
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R.O.C.
Shyue-Liang Wang
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R.O.C.

ABSTRACT

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow shop problem. Flexible flow shops can thus be thought of as generalizations of simple flow shops. In the past, Sriskandarajah and Sethi [6] proposed a heuristic algorithm for solving flexible flow shop problems for two machine centers. In this article, we extend their algorithm to solve flexible flow shop problems for more than two machine centers. The heuristic Gupta algorithm is adopted as the kernel for achieving this purpose. Because this problem is a nondeterministic-polynomial (NP)-complete problem, optimal solutions seem unnecessary, especially when the number of jobs is large.


Articles with similar content:

PLUG AND PLAY FRAMEWORK FOR COMBINATORAL PROBLEM HEURISTICS
Flexible Automation and Intelligent Manufacturing, 1997:
Proceedings of the Seventh International FAIM Conference, Vol.0, 1997, issue
Andrew Wooster
IMPROVING COST-EFFECTIVENESS OF LES BY USING NON-REFLECTING BOUNDARY CONDITIONS: THE FLOW AROUND SIMPLIFIED ICE2 TRAIN
TSFP DIGITAL LIBRARY ONLINE, Vol.6, 2009, issue
Sergei M. Frolov, Sinisa Krajnovic, Branislav Basara
Macroeconomic Security of Ukraine: Problematic Aspect of Research and Prospects of Strengthening
Journal of Automation and Information Sciences, Vol.50, 2018, issue 2
Marta I. Kopytko, Galina Ya. Levkiv , Mariya V. Vinichuk
AN INVERSE DESIGN METHOD FOR A WING IN FULL CRUISING CONFIGURATION OF A REGIONAL AIRCRAFT VIA RANS APPROACH
TsAGI Science Journal, Vol.51, 2020, issue 1
Anatoliy Longinovich Bolsunovsky, Nikolay Petrovich Buzoverya, Nikita Aleksandrovich Pushchin
Optimization on Arrangements: the Simplex Form of Polyhedron of Arrangements
Journal of Automation and Information Sciences, Vol.49, 2017, issue 12
Oleg A. Yemets, Alexandra O. Yemets, Ivan M. Polyakov