✦ LIBER ✦

A permutation flow-shop scheduling problem with convex models of operation processing times

✍ Scribed by T.C.E. Cheng; A. Janiak

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the m-mac

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

A two-machine flow shop scheduling probl

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 639 KB

A two-machine permutation flow shop sche

✍ Czesław Smutnicki 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 761 KB

Job-shop scheduling with convex models o

✍ A. Janiak; T. Szkodny 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 944 KB

Robust scheduling of a two-machine flow

✍ Panos Kouvelis; Richard L. Daniels; George Vairaktarakis 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 164 KB

The permutation flow shop problem with s

✍ Selcuk Karabati; Panagiotis Kouvelis 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 938 KB