A Geometric Model and a Graphical Algorithm for a Sequencing Problem

DOI10.1287/opre.11.6.889zbMath0124.36302OpenAlexW2059796104MaRDI QIDQ5328566

W. W. Hardgrave, Nemhauser, George I.

Publication date: 1963

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.11.6.889

zbMATH Keywords

operations research

Related Items

A new lower bound for the job-shop scheduling problem, NP-hardness of shop-scheduling problems with three jobs, Using mixed graph coloring to minimize total completion time in job shop scheduling, An efficient algorithm for the job-shop problem with two jobs, Parallel dedicated machines scheduling with chain precedence constraints, Parameterized mixed graph coloring, The complexity of two-job shop problems with multi-purpose unrelated machines., Scheduling co-operating stacking cranes with predetermined container sequences, Job-shop scheduling with multi-purpose machines, Complexity of mixed shop scheduling problems: A survey, The complexity of shop-scheduling problems with two or three jobs, Complexity of shop-scheduling problems with fixed number of jobs: a survey, Lower bounds for the job-shop scheduling problem on multi-purpose machines, Deterministic job-shop scheduling: Past, present and future, Reduction of job-shop problems to flow-shop problems with precedence constraints, Scheduling Models: Shibboleth and Operating Characteristics, Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function, Scheduling two jobs with fixed and nonfixed routes