Job-shop scheduling: limits of the binary disjunctive formulation

This publication has 21 references indexed in Scilit:

• A recent survey of production scheduling
  IEEE Transactions on Systems, Man, and Cybernetics, 1988
• An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications
  A I I E Transactions, 1982
• An Overview of Complexity Theory in Discrete Optimizations: Part I. Concepts
  A I I E Transactions, 1982
• Combinatorial Optimization: What is the State of the Art
  Mathematics of Operations Research, 1980
• Job-shop scheduling heuristics with local neighbourhood search
  International Journal of Production Research, 1979
• Job-Shop Scheduling by Implicit Enumeration
  Management Science, 1977
• A statistical comparison of the performance of simple dispatching rules for a particular set of job shops
  International Journal of Production Research, 1976
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
  Journal of the ACM, 1975
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
  Operations Research, 1969
• On the Job-Shop Scheduling Problem
  Operations Research, 1960