Minimizing the fleet size with dependent time-window and single-track constraints
Authors:
- 1 September 1993
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 14 (2) , 91-98
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraintsEuropean Journal of Operational Research, 1994
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window ConstraintsManagement Science, 1991
- A Crane Scheduling Problem in a Computer-Integrated Manufacturing EnvironmentManagement Science, 1991
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time WindowsManagement Science, 1988
- Hoist Scheduling For A PCB Electroplating FacilityIIE Transactions, 1988
- Routing and scheduling of vehicles and crewsComputers & Operations Research, 1983
- Mathematical Programming Solution of a Hoist Scheduling ProgramA I I E Transactions, 1976