✦ LIBER ✦

The complexity of the tabulation of trajectory problems

✍ Scribed by E.N. Gordeyev; V.K. Leont'ev

Publisher: Elsevier Science
Year: 1985
Weight: 222 KB
Volume: 25
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(85)90169-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms of polynomial complexity for

Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems

✍ E.N. Gordeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 481 KB

On the realizability of lengths in traje

On the realizability of lengths in trajectory problems

✍ V.K. Leont'ev 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 354 KB

On the problem of optimum rocket traject

On the problem of optimum rocket trajectories

✍ I.V. Ioslovich 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Properties of the trajectories of the ap

Properties of the trajectories of the appointments problem and the travelling-salesman problem

✍ S.P. Tarasov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 740 KB

The complexity of cyclic shop scheduling

The complexity of cyclic shop scheduling problems

✍ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol

The complexity of two group scheduling p

The complexity of two group scheduling problems

✍ Jacek Blazewicz; Mikhail Y. Kovalyov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem