An exact parallel algorithm for scheduling when production costs depend on consecutive system states
- 30 September 1990
- journal article
- Published by Elsevier BV in Computers & Chemical Engineering
- Vol. 14 (9), 1009-1023
- https://doi.org/10.1016/0098-1354(90)87057-v
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problemOperations Research Letters, 1989
- Primal-dual algrorithms for the assignment problemDiscrete Applied Mathematics, 1987
- Contention is no obstacle to shared-memory multiprocessingCommunications of the ACM, 1986
- Intermediate storage in noncontinuous processes involving stages of parallel unitsAIChE Journal, 1985
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman ProblemsPublished by Elsevier BV ,1977
- Optimal flowshop schedules with no intermediate storage spaceNaval Research Logistics Quarterly, 1976