Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains

Pages:117–124

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.117

Preview Abstract
Bounds and Approximations for Overheads in the Time to Join Parallel Forks

Pages:125–139

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.125

Preview Abstract
Spectral Analysis of Basic TES Processes

Pages:140–148

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.140

Preview Abstract
Stability of p-Persistent CSMA/CD

Pages:149–159

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.149

Preview Abstract
A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups

Pages:160–165

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.160

Preview Abstract
Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming

Pages:166–190

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.166

Preview Abstract
Optimal Scheduling of Tasks on Identical Parallel Processors

Pages:191–200

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.191

Preview Abstract
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem

Pages:201–204

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.201

Preview Abstract
Analyzing the Pooling Problem

Pages:205–217

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.205

Preview Abstract
A Matching Identification Problem: A Knowledge Acquisition Approach

Pages:218–231

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.218

Preview Abstract
Single Machine Scheduling to Minimize Total Weighted Late Work

Pages:232–242

Published Online:May 1, 1995

https://doi.org/10.1287/ijoc.7.2.232

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