Open Shop Scheduling is a scheduling problem in which a set of jobs must be processed on a set of machines, with the distinguishing feature that each job consists of a set of operations that can be executed in any order on their respective machines, and there are no predefined precedence constraints between the operations of the same job.
245
Publications
11.1K
Citations
416
Authors
237
Institutions
Publications per year
2017–2026
42
Publications
245
Open Shop Scheduling to Minimize Finish Time
Teofilo F. Gonzalez, Sartaj Sahni · Journal of the ACM · 1976 · 669 citations · Full text
1–5 of 245
Authors
416
- VA
16
h-index
- CL
9
h-index
- BN
8
h-index
- DD
7
h-index
- MZ
7
h-index
1–5 of 416
Institutions
237
University of Greenwich
London, United Kingdom
14 h-index
20 publications
746 citations
Chaoyang University of Technology
Taichung, Taiwan
9 h-index
13 publications
562 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
8 h-index
8 publications
224 citations
University of Toronto
Toronto, Canada
8 h-index
14 publications
584 citations
Shahid Beheshti University
Tehran, Iran
7 h-index
7 publications
272 citations
Decision Sciences (United States)
Fort Walton Beach, United States
7 h-index
11 publications
263 citations
Otto-von-Guericke-Universität Magdeburg
Magdeburg, Germany
7 h-index
22 publications
994 citations
Northeastern University
Shenyang, China
6 h-index
8 publications
232 citations
1–8 of 237
Venues
- European Journal of Operational Research
34 publications · 1.5K citations
21
h-index
- Computers & Operations Research
18 publications · 1.2K citations
16
h-index
- Operations Research Letters
15 publications · 384 citations
12
h-index
- Discrete Applied Mathematics
12 publications · 420 citations
10
h-index
- Naval Research Logistics (NRL)
10 publications · 263 citations
10
h-index
1–5