✦ LIBER ✦

An algorithm for single shift scheduling of hierarchical workforce

✍ Scribed by Rangarajan Narasimhan

Book ID: 108445300
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 560 KB
Volume: 96
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(96)00364-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-shift off-day scheduling of a hie

Single-shift off-day scheduling of a hierarchical workforce with variable demands

✍ Rudy Hung 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB

An integer programming model for hierarc

An integer programming model for hierarchical workforce scheduling problem

✍ Serap Ulusam Seçkiner; Hadi Gökçen; Mustafa Kurt 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 127 KB

An algorithm for shift scheduling which

An algorithm for shift scheduling which considers circadian principles

✍ M.M. Kostreva; P. Genevier; K.S.B. Jennings 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 491 KB

An exact algorithm for single-machine sc

An exact algorithm for single-machine scheduling without

✍ Shunji Tanaka; Shuji Fujikuma; Mituhiko Araki 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 552 KB

Algorithm of shifts for optimal structur

Algorithm of shifts for optimal structural schedules

✍ K. V. Shakhbazyan 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 615 KB

An approximation algorithm for the prece

An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications

✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude König 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary