✦ LIBER ✦

Variants of the time minimization assignment problem

✍ Scribed by Rita Malhotra; H. L. Bhatia

Book ID: 112928443
Publisher: Springer-Verlag
Year: 1984
Weight: 223 KB
Volume: 35
Category: Article
ISSN: 0041-0241
DOI: 10.1007/bf02889707

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A variant of time minimizing assignment

A variant of time minimizing assignment problem

✍ Shalini Arora; M.C. Puri 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 720 KB

A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more

Two-stage time minimizing assignment pro

Two-stage time minimizing assignment problem

✍ Sonia; M.C. Puri 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Exact Algorithms for the Imbalanced Time

Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem

✍ Felipe Martins Müller; Mauro Marafiga Camozzato; Olinto César Bassi de Araújo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Area-time complexity of the unconstraine

Area-time complexity of the unconstrained minimization problem

✍ B. Codenotti; P. Favati 📂 Article 📅 1986 🏛 Springer Milan 🌐 English ⚖ 303 KB

Variants of the hungarian method for ass

Variants of the hungarian method for assignment problems

✍ H. W. Kuhn 📂 Article 📅 1956 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB 👁 1 views

The author p r e s e n t s a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the assignment problem.

The processor minimization problem with

The processor minimization problem with independent waiting-time constraints

✍ E.G. Coffman Jr.; Leopold Flatto; Bjorn Poonen; Paul E. Wright 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 743 KB