Skip to search formSkip to main contentSkip to account menu

Flow shop scheduling

Known as: Flow Shop Scheduling Problem, Flow Shop Scheduling problems 
Flow shop scheduling problems, are a class of scheduling problems with a workshop or group shop in which the flow control shall enable an appropriate… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper investigates an integrated optimisation problem of production scheduling and preventive maintenance (PM) in a two… 
2010
2010
This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion… 
2007
2007
This paper presents a new approach of differential evolution to scheduling optimization problem. The developed approach is viewed… 
2006
2006
Scheduling problem is a kind of well-known combination optimization problem, and many scheduling problems are NP problems… 
2006
2006
This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural… 
Highly Cited
2004
Highly Cited
2004
The flow-shop scheduling problem is one of the most well-known problems in the area of scheduling. The objective of minimising… 
2000
2000
We investigate the genetic algorithm approach for scheduling hybrid flow shops with minimum makespan as performance measure. The… 
Highly Cited
1999
Highly Cited
1999
The present paper reports on a new approach to applying a genetic algorithm to the flow-shop scheduling problem. Three different… 
1970
1970
Abstract This article is concerned with the solution of the flow shop scheduling problem in which all jobs have the same machine…