Flowshop Sequencing Problem with Ordered Processing Time Matrices
Management SciencePublished 1 January 1975
Marquard Smith, S. S. Panwalkar, Richard A. Dudek
Citations86
SJR quartileQ1
SJR score5.72
SNIP2.88
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
A flowshop sequencing problem having an ordered processing time matrix is defined. Job and machine characteristics resulting in processing time relationships that have logical and practical bases are discussed. An optimizing solution procedure for a special class of ordered matrix problem is presented along with proof of optimality.
Keywords
Engineering
Naval Research Logistics QuarterlyOptimal two‐ and three‐stage production schedules with setup times included
3,231 Citations1954S. M. Johnson
A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Operations ResearchFlow-Shop Scheduling with the Branch-and-Bound Method
152 Citations1967Graham McMahon, P. G. Burton
The branch-and-bound technique has been applied to the three machine flow shop problem where the objective is to minimize makespan and a new method of obtaining the bound has been developed.
Operations ResearchDevelopment of <i>M</i>-Stage Decision Rule for Scheduling N Jobs Through <i>M</i> Machines
80 Citations1964Richard A. Dudek, Ottis Foy Teuton
This paper describes an algorithm that will yield an optimum sequence for n jobs requiring processing through M machines when no passing is allowed and an example problem.