Research Article

SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing

Pages:319–334

Published Online:November 1, 1997

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

A Branch and Cut Approach for Workload Smoothing on Assembly Lines

Pages:335–350

Published Online:November 1, 1997

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

Scheduling Periodic Tasks with Slack

Pages:351–362

Published Online:November 1, 1997

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

Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors

Pages:363–373

Published Online:November 1, 1997

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

A Tabu-Search Heuristic for the Dynamic Plant Layout Problem

Pages:374–384

Published Online:November 1, 1997

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

Adding Value to Induced Decision Trees for Time-Sensitive Data

Pages:385–396

Published Online:November 1, 1997

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

An Integrated Modeling System for Structured Modeling Using Model Graphs

Pages:397–416

Published Online:November 1, 1997

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

A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows

Pages:417–430

Published Online:November 1, 1997

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

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

Pages:431–438

Published Online:November 1, 1997

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

Vector Quantization for Arbitrary Distance Function Estimation

Pages:439–451

Published Online:November 1, 1997

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

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.