✦ LIBER ✦

Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities

✍ Scribed by Joo, Cheol Min; Kim, Byung Soo

Book ID: 121180927
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 569 KB
Volume: 40
Category: Article
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2012.12.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling with general p

Single machine scheduling with general positional deterioration and rate-modifying maintenance

✍ Kabir Rustogi; Vitaly A. Strusevich 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Single-Machine Scheduling With Job-Posit

Single-Machine Scheduling With Job-Position-Dependent Learning and Time-Dependent Deterioration

✍ Yunqiang Yin; Min Liu; Jinghua Hao; Mengchu Zhou 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 197 KB

Single machine scheduling with time-depe

Single machine scheduling with time-dependent deterioration and exponential learning effect

✍ Xue Huang; Ji-Bo Wang; Li-Yan Wang; Wen-Jun Gao; Xue-Ru Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Single machine common flow allowance sch

Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity

✍ Bai, Jing; Li, Zhi-Rong; Wang, Jian-Jun; Huang, Xue 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Genetic algorithm for rotary machine sch

Genetic algorithm for rotary machine scheduling with dependent processing times

✍ Jing Huang, Gürsel A. Süer, Shravan B. R. Urs 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 906 KB

Single machine scheduling with past-sequ

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func