Results: 17
Three-Stage Flow-Shops with Recessive Second Stage.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 207, doi. 10.1287/opre.26.1.207
- By:
- Publication type:
- Article
Dominance Conditions for the Three-Machine Flow-Shop Problem.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 203, doi. 10.1287/opre.26.1.203
- By:
- Publication type:
- Article
Improve Dominance Conditions for the Three-Machines Flowshop Scheduling Problem.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 200, doi. 10.1287/opre.26.1.200
- By:
- Publication type:
- Article
A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 197, doi. 10.1287/opre.26.1.197
- By:
- Publication type:
- Article
Scheduling Boats to Sample Oil Wells in Lake Maracaibo.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 183, doi. 10.1287/opre.26.1.183
- By:
- Publication type:
- Article
An Algorithm for the Space-Shuttle Scheduling Problem.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 166, doi. 10.1287/opre.26.1.166
- By:
- Publication type:
- Article
The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 159, doi. 10.1287/opre.26.1.159
- By:
- Publication type:
- Article
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 141, doi. 10.1287/opre.26.1.141
- By:
- Publication type:
- Article
On a Real-Time Scheduling Problem.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 127, doi. 10.1287/opre.26.1.127
- By:
- Publication type:
- Article
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 121, doi. 10.1287/opre.26.1.121
- By:
- Publication type:
- Article
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 111, doi. 10.1287/opre.26.1.111
- By:
- Publication type:
- Article
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 86, doi. 10.1287/opre.26.1.86
- By:
- Publication type:
- Article
Minimal Resources for Fixed and Variable Job Schedules.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 68, doi. 10.1287/opre.26.1.68
- By:
- Publication type:
- Article
A General Bounding Scheme for the Permutation Flow-Shop Problem.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 53, doi. 10.1287/opre.26.1.53
- By:
- Publication type:
- Article
Flowshop and Jobshop Schedules: Complexity and Approximation.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 36, doi. 10.1287/opre.26.1.36
- By:
- Publication type:
- Article
Complexity of Scheduling under Precedence Constraints.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 22, doi. 10.1287/opre.26.1.22
- By:
- Publication type:
- Article
Performance Guarantees for Scheduling Algorithms.
- Published in:
- Operations Research, 1978, v. 26, n. 1, p. 3
- By:
- Publication type:
- Article