Journal Article10.1016/S0377-2217(99)00415-4
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
28
TL;DR: The branch and bound algorithm proposed here combines an adaptive branching rule with a fuzzy search strategy to narrow the search tree and lead the search to an optimal solution as early as possible.
read more
About: This article is published in European Journal of Operational Research. The article was published on 01 May 2001. The article focuses on the topics: Branch and bound & Job shop scheduling.
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
Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
Alireza Rahimi-Vahed,Ali Hossein Mirzaei +1 more
- 01 Mar 2008
TL;DR: A new multi-objective shuffled frog-leaping algorithm (MOSFLA) is introduced for the first time to search locally Pareto-optimal frontier for the given problem and performs better than the above genetic algorithms, especially for the large-sized problems.
76
Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time
Seyedeh Sarah Zabihzadeh,Javad Rezaeian +1 more
- 01 Mar 2016
TL;DR: The main contribution of this study is to present the mixed integer linear programming model for the problem which considers release times for parts in scheduling area, loading and unloading times of parts which transferred by robots.
59
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
TL;DR: The objectives of this review are to provide guidelines for future research in the application of the Branch-and-Bound algorithm for scheduling problems and also to be used as an index for authors to locate the articles for particular problems within the state-of-the-art literature.
47
No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates
TL;DR: This paper considers the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates, and proposes several lower bounds and upper bounds.
A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates
TL;DR: In this paper, a modified harmony search optimisation algorithm (MHSO) was proposed to solve two-and three-objective permutation flow shop scheduling problems, with due dates.
References
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
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.
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
2.6K
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
Benchmarks for basic scheduling problems
TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.
2.5K