Fuzzy heuristic algorithm for simultaneous scheduling problems in flexible manufacturing system
TL;DR: In this article, a fuzzy heuristic is proposed for solving the simultaneous scheduling problem, in order to minimize the makespan by considering the available resources, and the algorithm is tested based on 82 benchmark problems and the achieved makespan are compared with other algorithms.
read more
Abstract: Article history: Received: July 20, 2018 Received in revised format: August 28, 2018 Accepted: September 15, 2018 Available online: September 15, 2018 This paper addresses the flexible manufacturing system (FMS) problems considering both machines and automated guided vehicles (AGVs), simultaneously. A new fuzzy heuristic (FH) is proposed for solving the simultaneous scheduling problem, in order to minimize the makespan by considering the available resources. For increasing the performance of FMS one of the important factors is scheduling AGV with an integral part of the machine scheduling activity. The algorithm is tested based on 82 benchmark problems and the achieved makespan are compared with other algorithms. © 2018 by the authors; licensee Growing Science, Canada
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fuzzy heuristic algorithm for simultaneous scheduling problems in flexible manufacturing system
TL;DR: In this article, a fuzzy heuristic is proposed for solving the simultaneous scheduling problem, in order to minimize the makespan by considering the available resources, and the algorithm is tested based on 82 benchmark problems and the achieved makespan are compared with other algorithms.
References
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2.5K
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more
TL;DR: This work presents a new iterated greedy algorithm that applies two phases iteratively, named destruction, were some jobs are eliminated from the incumbent solution, and construction, where the eliminated jobs are reinserted into the sequence using the well known NEH construction heuristic.
1.1K
A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
TL;DR: A simple algorithm for the solution of very large sequence problems without the use of a computer that produces approximate solutions to the n job, m machine sequencing problem where no passing is considered and the criterion is minimum total elapsed time.
984
Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum
TL;DR: It is suggested that the optimum (minimum total time) scheduling may be approximated by giving priority to items according to the extent to which process time increases with process number in order.
596