Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Performance Guarantees for Scheduling Algorithms

Pages:3–21

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.3

Preview Abstract
Complexity of Scheduling under Precedence Constraints

Pages:22–35

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.22

Preview Abstract
Flowshop and Jobshop Schedules: Complexity and Approximation

Pages:36–52

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.36

Preview Abstract
A General Bounding Scheme for the Permutation Flow-Shop Problem

Pages:53–67

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.53

Preview Abstract
Minimal Resources for Fixed and Variable Job Schedules

Pages:68–85

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.68

Preview Abstract
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

Pages:86–110

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.86

Preview Abstract
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks

Pages:111–120

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.111

Preview Abstract
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times

Pages:121–126

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.121

Preview Abstract
On a Real-Time Scheduling Problem

Pages:127–140

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.127

Preview Abstract
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

Pages:141–158

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.141

Preview Abstract
The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions

Pages:159–165

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.159

Preview Abstract
An Algorithm for the Space-Shuttle Scheduling Problem

Pages:166–182

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.166

Preview Abstract
Scheduling Boats to Sample Oil Wells in Lake Maracaibo

Pages:183–196

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.183

Preview Abstract
Free Access
Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline

Pages:197–199

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.197

Preview Abstract
Free Access
Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem

Pages:200–203

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.200

Preview Abstract
Free Access
Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem

Pages:203–206

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.203

Preview Abstract
Free Access
Technical Note—Three-Stage Flow-Shops with Recessive Second Stage

Pages:207–208

Published Online:February 1, 1978

https://doi.org/10.1287/opre.26.1.207

Preview Abstract
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree