A Branch-Bound Solution to the General Scheduling Problem
From MaRDI portal
Publication:5538322
DOI10.1287/opre.16.2.353zbMath0155.28704MaRDI QIDQ5538322
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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Related Items
Dynamical Neural Network Approach to the Job-shop Scheduling, Timetabling optimization of a single railway track line with sensitivity analysis, 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
