Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

DOI10.1287/opre.17.6.941zbMath0183.49404OpenAlexW2111244700MaRDI QIDQ5575251

Egon Balas

Publication date: 1969

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

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

zbMATH Keywords

operations research

Related Items (68)

Ant colony optimisation with parameterised search space for the job shop scheduling problem ⋮ A tabu search experience in production scheduling ⋮ Routing and scheduling in a flexible job shop by tabu search ⋮ The project scheduling polyhedron: Dimension, facets and lifting theorems ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Adjustment of heads and tails for the job-shop problem ⋮ Evolution based learning in a job shop scheduling environment ⋮ Effective job shop scheduling through active chain manipulation ⋮ Permutation-induced acyclic networks for the job shop scheduling problem ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems ⋮ A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem ⋮ A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times ⋮ Mixed graph colorings ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ An Exact Decomposition Approach for the Real-Time Train Dispatching Problem ⋮ The durations ofmprojects for achieving minimization of cost and optimal resource allocation ⋮ A fluid approach to large volume job shop scheduling ⋮ Minimizing total weighted tardiness in a generalized job shop ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ Dynamical Neural Network Approach to the Job-shop Scheduling ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems ⋮ A repairing technique for the local search of the job-shop problem. ⋮ A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management ⋮ A tabu search method guided by shifting bottleneck for the job shop scheduling problem ⋮ Considering project management activities for engineering design groups ⋮ Complexity, bounds and dynamic programming algorithms for single track train scheduling ⋮ Unnamed Item ⋮ Fuzzy job-shop scheduling problems: a review ⋮ A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization ⋮ A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems ⋮ The job shop scheduling problem with convex costs ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ One-machine rescheduling heuristics with efficiency and stability as criteria ⋮ Bounds and initial solutions for frame ineration in machine scheduling ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ A dynamic job shop scheduling framework: a backward approach ⋮ Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling ⋮ Jackson's pseudo-preemptive schedule and cumulative scheduling problems ⋮ Nested partitions for the large-scale extended job shop scheduling problem ⋮ On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems ⋮ A unified formulation of the machine scheduling problem ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ Job-shop scheduling with resource-time models of operations ⋮ Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer ⋮ A clique search problem and its application to machine scheduling ⋮ Heuristics for minimizing total weighted tardiness in flexible flow shops ⋮ An tentative taboo search algorithm for job shop scheduling ⋮ Decomposition methods for reentrant flow shops with sequence-dependent setup times ⋮ On a multiconstrained model for chromatic scheduling ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Benchmarks for shop scheduling problems ⋮ Job-shop scheduling with blocking and no-wait constraints ⋮ Decomposition methods for large job shops ⋮ Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops ⋮ A tabu search approach to machine scheduling ⋮ Two alternative models for farm management: Discrete versus continuous time horizon

This page was built for publication: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm