A Geometric Model and a Graphical Algorithm for a Sequencing Problem

DOI10.1287/OPRE.11.6.889MaRDI QIDQ5328566zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

operations research

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
• Job-shop scheduling with multi-purpose machines
• Deterministic job-shop scheduling: Past, present and future
• 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)