Open-shop scheduling

Known as: Open shop scheduling, Open shop scheduling problem 
In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by… (More)
  • figure 3
Is this relevant?
2008
2008
IN this paper, a new approach to formulate a class of scheduling problems is introduced, which can be applied to many other… (More)
  • table 1
  • figure 1
  • table 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic component… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2004
2004
The paper concerns the application of a non-classical performance measure, a late work criterion (Y, Yw), to scheduling problems… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Speci®cally, we test the… (More)
  • table 2
  • table 3
  • table 4
  • figure 1
  • figure 2
Is this relevant?
1999
1999
In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We combine genetic algorithms and case-based reasoning principles to nd optimally directed solutions to open shop scheduling and… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Many problems in industry are a form of open-shop scheduling problem (OSSP). We describe a hybrid approach to this problem which… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial time… (More)
  • figure 1
  • figure 2
Is this relevant?