Scheduling tasks with sequence-dependent processing times
- 1 April 1988
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 35 (2), 177-184
- https://doi.org/10.1002/1520-6750(198804)35:2<177::aid-nav3220350203>3.0.co;2-v
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine SchedulingOperations Research, 1978