Journal Article10.1016/J.IJPE.2005.02.006
Sequence-dependent group scheduling problems in flexible flow shops
100
TL;DR: Group scheduling within the context of sequence dependent setup times in flexible flow shops is considered, and the search algorithm that uses short term memory is recommended for problems of all sizes and levels of flexibility.
read more
About: This article is published in International Journal of Production Economics. The article was published on 01 Jul 2006. The article focuses on the topics: Job shop scheduling & Flow 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
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
1.4K
The hybrid flow shop scheduling problem
TL;DR: A literature review on exact, heuristic and metaheuristic methods that have been proposed for the solution of the hybrid flow shop problem is presented.
780
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
TL;DR: An extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented and the papers are classified first according to the HFS characteristics and production limitations considered in the respective papers and then according toThe solution approach proposed.
457
Hybrid flow shop scheduling considering machine electricity consumption cost
TL;DR: The results from computational experiments indicate that the efficiency and effectiveness of the proposed MOACO are comparable to NSGA-II and SPEA2 and shows that durations of TOU periods and processing speed of machines have great influence on scheduling results as longer off-peak period and use of faster machines provide more flexibility for shifting high-energy operations to off- peak periods.
380
Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach
TL;DR: This study strives to minimize multi-objective flexible flowshop considering sequence-dependent setup times using Pareto archive concepts, and investigates the performance of the algorithm through comparing two last stage of it with a distinguished benchmark, multi-Objective genetic algorithm (MOGA).
156
References
•Book
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo
- 15 Jul 1994
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
7.2K
Tabu Search—Part II
TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
6.1K
Future paths for integer programming and links to artificial intelligence
TL;DR: Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.
4.5K
Tabu Search: A Tutorial
TL;DR: This paper presents tabu search, a heuristic procedure designed to guide other methods to escape the trap of local optimality, which has obtained optimal and near optimal solutions to a wide variety of classical and practical problems.
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