𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling flexible job shop problem subject to machine breakdown with game theory

✍ Scribed by Sun, Di-hua; He, Wei; Zheng, Lin-jiang; Liao, Xiao-yong

Book ID
121083180
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
442 KB
Volume
52
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling jobs with random processing t
Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
✍ X. Cai; F. S. Tu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec

[Lecture Notes in Computer Science] Arti
[Lecture Notes in Computer Science] Artificial Intelligence and Soft Computing Volume 7895 || A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing
✍ Rutkowski, Leszek; Korytkowski, Marcin; Scherer, RafaΕ‚; Tadeusiewicz, Ryszard; Z πŸ“‚ Article πŸ“… 2013 πŸ› Springer Berlin Heidelberg 🌐 English βš– 195 KB

The two-volume set LNAI 7894 and LNCS 7895 constitutes the refereed proceedings of the 12th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2013, held in Zakopane, Poland in June 2013. The 112 revised full papers presented together with one invited paper were carefully