# Open-shop scheduling

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- 2014

The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized byâ€¦Â (More)

Is this relevant?

2008

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)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Computers & OR
- 2005

Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial optimization problems. The basic componentâ€¦Â (More)

Is this relevant?

2004

2004

- Discrete Applied Mathematics
- 2004

The paper concerns the application of a non-classical performance measure, a late work criterion (Y, Yw), to scheduling problemsâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- European Journal of Operational Research
- 2000

In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. SpeciÂ®cally, we test theâ€¦Â (More)

Is this relevant?

1999

1999

- EPIA
- 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

- 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

- ECAI
- 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

- 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

- J. ACM
- 1976

A linear time algorithm to obtain a minimum finish time schedule for the two-processor open shop together with a polynomial timeâ€¦Â (More)

Is this relevant?