| Article ID: | iaor1995568 |
| Country: | Czech Republic |
| Volume: | 2 |
| Issue: | 1 |
| Start Page Number: | 65 |
| End Page Number: | 78 |
| Publication Date: | Jan 1993 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Florkiewicz Bronisaw, Kulej Micha |
| Keywords: | programming: linear |
The necessary and sufficient conditions for the existence of feasible time schedule of the route in the vehicle routing and scheduling problem with time window constraints is presented. A direct, non-simplex method for obtaining minimal time schedules is given.