M-stage scheduling problem—a critical appraisal

1 January 1971

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

Vol. 9 (2) , 267-281
https://doi.org/10.1080/00207547108929878

Abstract

The deterministic M-stage scheduling problem is reviewed and critically appraised from the points of view of variety, contents, assumptions, recent solution procedures and criteria of optimality. The complications of practical problems are discussed to explore the true nature of the problem formulation. Several implications of the present formulation of scheduling problem are discussed and directions for future research in scheduling theory are suggested.

Keywords

This publication has 21 references indexed in Scilit:

The Sequencing Problem
Management Science, 1969
A Branch-Bound Solution to the General Scheduling Problem
Operations Research, 1968
INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS∗
International Journal of Production Research, 1968
A GENERAL METHOD FOR MACHINE SCHEDULING
International Journal of Production Research, 1968
Discrete Programming by the Filter Method
Operations Research, 1967
Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem
Journal of the Operational Research Society, 1966
Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems
Operations Research, 1965
Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
Operations Research, 1964
The Schedule-Sequencing Problem
Operations Research, 1959
Optimal two‐ and three‐stage production schedules with setup times included
Naval Research Logistics Quarterly, 1954