Job-shop scheduling: limits of the binary disjunctive formulation
- 1 December 1990
- journal article
- Published by Informa UK Limited in International Journal of Production Research
- Vol. 28 (12), 2187-2200
- https://doi.org/10.1080/00207549008942861
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A recent survey of production schedulingIEEE Transactions on Systems, Man, and Cybernetics, 1988
- An Overview of Complexity Theory in Discrete Optimization: Part II. Results and ImplicationsA I I E Transactions, 1982
- An Overview of Complexity Theory in Discrete Optimizations: Part I. ConceptsA I I E Transactions, 1982
- Combinatorial Optimization: What is the State of the ArtMathematics of Operations Research, 1980
- Job-shop scheduling heuristics with local neighbourhood searchInternational Journal of Production Research, 1979
- Job-Shop Scheduling by Implicit EnumerationManagement Science, 1977
- A statistical comparison of the performance of simple dispatching rules for a particular set of job shopsInternational Journal of Production Research, 1976
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- On the Job-Shop Scheduling ProblemOperations Research, 1960