scispace - formally typeset
Search or ask a question
Topic

Flow shop scheduling

About: Flow shop scheduling is a research topic. Over the lifetime, 14392 publications have been published within this topic receiving 333390 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown that the problem of finding an optimal schedule for a set of jobs is NP-complete even in the following two restricted cases, tantamount to showing that the scheduling problems mentioned are intractable.

1,356 citations

Journal ArticleDOI
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,264 citations

Journal ArticleDOI
TL;DR: In this article, an approximation algorithm for the problem of finding the minimum makespan in a job shop is presented, which is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
Abstract: We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems. The generalization involves the acceptance of cost-increasing transitions with a nonzero probability to avoid getting stuck in local minima. We prove that our algorithm asymptotically converges in probability to a globally minimal solution, despite the fact that the Markov chains generated by the algorithm are generally not irreducible. Computational experiments show that our algorithm can find shorter makespans than two recent approximation approaches that are more tailored to the job shop scheduling problem. This is, however, at the cost of large running times.

1,107 citations

Journal ArticleDOI
TL;DR: A general scheduling methodology is presented that can be integrated into specialized or general-purpose high-level synthesis systems and reduces the number of functional units, storage units, and buses required by balancing the concurrency of operations assigned to them.
Abstract: A general scheduling methodology is presented that can be integrated into specialized or general-purpose high-level synthesis systems. An initial version of the force-directed scheduling algorithm at the heart of this methodology was originally presented by the authors in 1987. The latest implementation of the logarithm introduced here reduces the number of functional units, storage units, and buses required by balancing the concurrency of operations assigned to them. The algorithm supports a comprehensive set of constraint types and scheduling modes. These include multicycle and chained operations; mutually exclusive operations; scheduling under fixed global timing constraints with minimization of functional unit costs, minimization of register costs, and minimization of global interconnect requirements; scheduling with local time constraints (on operation pairs); scheduling under fixed hardware resource constraints; functional pipelining; and structural pipeline (use of pipeline functional units). Examples from current literature, one of which was chosen as a benchmark for the 1988 High-Level Synthesis Workshop, are used to illustrate the effectiveness of the approach. >

1,093 citations

Book
01 Jan 1976

1,012 citations


Network Information
Related Topics (5)
Scheduling (computing)
78.6K papers, 1.3M citations
89% related
Supply chain management
39K papers, 1M citations
87% related
Supply chain
84.1K papers, 1.7M citations
86% related
Genetic algorithm
67.5K papers, 1.2M citations
85% related
Optimization problem
96.4K papers, 2.1M citations
85% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023138
2022338
2021279
2020272
2019295
2018279