The routing open-shop problem on a network: Complexity and approximation
- 1 September 2006
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 173 (2) , 531-539
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A 65-approximation algorithm for the two-machine routing open-shop problem on a two-node networkEuropean Journal of Operational Research, 2005
- A heuristic for the two-machine open-shop scheduling problem with transportation timesDiscrete Applied Mathematics, 1999
- Two-machine open shop scheduling with special transportation timesJournal of the Operational Research Society, 1999
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling ProblemsOperations Research, 1999
- Vehicle scheduling on a tree with release and handling timesAnnals of Operations Research, 1997
- Routing Two-Machine Flowshop Problems on Networks with Special StructureTransportation Science, 1996
- Chapter 2 Time constrained routing and scheduling1995
- The Delivery Man Problem and Cumulative MatroidsOperations Research, 1993
- Two-machine shop scheduling problems with batch processingMathematical and Computer Modelling, 1993
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976