A Branch-Bound Solution to the General Scheduling Problem

DOI10.1287/OPRE.16.2.353MaRDI QIDQ5538322zbMATH OpenOpenAlexFDO

Authors Harold Greenberg

Publication date 1968

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(13)

• A mixed integer program for loading and scheduling multiple flexible manufacturing cells
• Multiple and bicriteria scheduling: A literature survey
• Integer programming formulation of combinatorial optimization problems
• A unified formulation of the machine scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
• Deterministic job-shop scheduling: Past, present and future
• Bicriteria train scheduling for high-speed passenger railroad planning applications
• Dynamical Neural Network Approach to the Job-shop Scheduling
• Fuzzy job-shop scheduling problems: a review
• Timetabling optimization of a mixed double- and single-tracked railway network
• Timetabling optimization of a single railway track line with sensitivity analysis

This page was built for publication: A Branch-Bound Solution to the General Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538322)