✦ LIBER ✦

The Operator-Scheduling Problem: A Network-Flow Approach

✍ Scribed by M. Segal

Book ID: 123686614
Publisher: INFORMS
Year: 1974
Tongue: English
Weight: 467 KB
Volume: 22
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169957

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multicommodity network flow approach to

Multicommodity network flow approach to the railroad crew-scheduling problem

✍ Vaidyanathan, B.; Jha, K. C.; Ahuja, R. K. 📂 Article 📅 2007 🏛 IBM 🌐 English ⚖ 315 KB

A tabu search approach for the flow shop

A tabu search approach for the flow shop scheduling problem

✍ M. Ben-Daya; M. Al-Fawzan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 788 KB

In this paper, we propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification

A SOMO-based approach to the operating r

A SOMO-based approach to the operating room scheduling problem

✍ Mu-Chun Su; Shih-Chang Lai; Pa-Chun Wang; Yi-Zeng Hsieh; Shih-Chieh Lin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 711 KB

Network flow approaches to pre-emptive o

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows

✍ A. Sedeño-Noda; D. Alcaide; C. González-Martín 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Solving the resource constrained deadlin

Solving the resource constrained deadline scheduling problem via reduction to the network flow problem

✍ Jacek Ba̵ażewicz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A minimum-cost network flow approach to

A minimum-cost network flow approach to preemptive parallel-machine scheduling

✍ Su, Ling-Huey; Cheng, T.C.E.; Chou, Fuh-Der 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 285 KB