The routing open-shop problem on a network: Complexity and approximation
Article Abstract:
Solution for routing open-shop problem is derived using polynomial-time approximation heuristics.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
Article Abstract:
Linear time approximation algorithm to examine multistage scheduling problems is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
Algorithms for the robust 1-center problem on a tree
Article Abstract:
The weighted 1-center problem is considered.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: The precarious politics of prosperity. Head to head, neck and neck
- Abstracts: The Scottish play. A long way from America: Creditanstalt's flawed renaissance. The last crisis?
- Abstracts: Feuding Indian brothers near pact on how to divide Reliance Group. How two principals in Clinton scandals joined in Jakarta
- Abstracts: UK: More pensions business for IFAs. UK: Novel approach for CGNU with profits fund. UK: 72% OF IFAS TO EMBRACE STAKEHOLDER PENSION
- Abstracts: Shedding new light... Conflict resolution. Cast away in an upturned boat