A Geometric Model and a Graphical Algorithm for a Sequencing Problem
From MaRDI portal
Publication:5328566
DOI10.1287/OPRE.11.6.889zbMATH Open0124.36302OpenAlexW2059796104MaRDI QIDQ5328566FDOQ5328566
W. W. Hardgrave, G. L. Nemhauser
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
Cited In (18)
- A new lower bound for the job-shop scheduling problem
- Parameterized mixed graph coloring
- An efficient algorithm for the job-shop problem with two jobs
- Parallel dedicated machines scheduling with chain precedence constraints
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- Scheduling two jobs with fixed and nonfixed routes
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- NP-hardness of shop-scheduling problems with three jobs
- Complexity of mixed shop scheduling problems: A survey
- The complexity of two-job shop problems with multi-purpose unrelated machines.
- The complexity of shop-scheduling problems with two or three jobs
- Scheduling co-operating stacking cranes with predetermined container sequences
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with multi-purpose machines
- Lower bounds for the job-shop scheduling problem on multi-purpose machines
- Scheduling Models: Shibboleth and Operating Characteristics
This page was built for publication: A Geometric Model and a Graphical Algorithm for a Sequencing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5328566)
