A New Algorithm of Solving the Flow — Shop Problem

Publisher Website

1 January 1982

book chapter
Published by Springer Nature

p. 57-75
https://doi.org/10.1007/978-94-009-7901-7_6

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

A General Bounding Scheme for the Permutation Flow-Shop Problem
Operations Research, 1978
Johnson's approximate method for the 3 × n job shop problem
Naval Research Logistics Quarterly, 1977
Complexity of Machine Scheduling Problems
Published by Elsevier ,1977
Minimizing maximum lateness on one machine: computational experience and some applications
Statistica Neerlandica, 1976
Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem
Journal of the Operational Research Society, 1966
Optimal two‐ and three‐stage production schedules with setup times included
Naval Research Logistics Quarterly, 1954