Extending chip in order to solve complex scheduling and placement problems
Authors:
- Abderrahmane AggounAAAbderrahmane Aggoun
- Nicolas BeldiceanuNBNicolas Beldiceanu
- 1 April 1993
- journal article
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 17 (7) , 57-73
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Object-oriented interaction in resource constrained schedulingInformation Processing Letters, 1990
- Solving large combinatorial problems in logic programmingThe Journal of Logic Programming, 1990
- Optimization by Simulated AnnealingScience, 1983
- A New Algorithm of Solving the Flow — Shop Problem1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- Simple perfect squared square of lowest orderJournal of Combinatorial Theory, Series B, 1978
- A language and a program for stating and solving combinatorial problemsArtificial Intelligence, 1978
- A heuristic problem solving design system for equipment or furniture layoutsCommunications of the ACM, 1975
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965