✦ LIBER ✦

Approximation algorithms for the parallel flow shop problem

✍ Scribed by Xiandong Zhang; Steef van de Velde

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient approximation algorithms for t

✍ Chernykh, Ilya; Kononov, Alexander; Sevastyanov, Sergey 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Heuristic algorithms for continuous flow

✍ Chandrasekharan Rajendran; Dipak Chaudhuri 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB 👁 1 views

Approximation Algorithms for the Unsplit

✍ Amit Chakrabarti; Chandra Chekuri; Anupam Gupta; Amit Kumar 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 270 KB

Parallel hybrid heuristics for the permu

✍ Martín Gómez Ravetti, Carlos Riveros, Alexandre Mendes, Mauricio G. C. Resende, 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 585 KB

Solving flow shop scheduling problem usi

✍ Mostafa Akhshabi; Javad Haddadnia; Mohammad Akhshabi 📂 Article 📅 2012 🏛 Elsevier ⚖ 228 KB

Modified simulated annealing algorithms

✍ Hisao Ishibuchi; Shinta Misaki; Hideo Tanaka 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 758 KB