An introduction to multi-parameter complexity analysis of discrete problems

Article Abstract:

Multi-parameter complexity analysis which examines sub problems under all possible parameter constraints used in understanding discrete machine scheduling problems is explored. Results demonstrate the key elements of this system of analysis.

Russia, Usage, Combinatorial optimization

---

Complexity results for flow-shop problems with a single server

Article Abstract:

The problem of flow-shop with a single server is examined. Results for special cases of such problems due to one server capable of processing only one machineEs set-up time are presented.

China, Analysis

---

Similar abstracts:

• Abstracts: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
• Abstracts: Definition and properties of the input-weighted average lead-time. part 2 Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems
• Abstracts: A preemptive priority queue with balking. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Abstracts: Determinants of the use of internet as a tourist information source. The relationship between timing of tipping and service effort
• Abstracts: Mathematical programming approach to the Petri nets reachability problem. The shift team formation problem in multi-shift manufacturing operations

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.