A new approach for the optimum solution of the M by J production scheduling problem

Publisher Website

1 January 1976

journal article
Published by Taylor & Francis in International Journal of Production Research

Vol. 14 (1) , 77-83
https://doi.org/10.1080/00207547608956581

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem
Journal of the Operational Research Society, 1965
An Algorithm for the Traveling Salesman Problem
Operations Research, 1963
Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
Operations Research, 1960
Optimal two‐ and three‐stage production schedules with setup times included
Naval Research Logistics Quarterly, 1954