✦ LIBER ✦

Single-machine bicriterion group scheduling with deteriorating setup times and job processing times

✍ Scribed by Wang, Jian-Jun; Liu, Ya-Jing

Book ID: 125486776
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 285 KB
Volume: 242
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2014.05.048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Group scheduling with independent setup

Group scheduling with independent setup times, ready times, and deteriorating job processing times

✍ Wang, Ji-Bo; Huang, Xue; Wu, Yu-Bin; Ji, Ping 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 237 KB

Single machine serial-batching schedulin

Single machine serial-batching scheduling with independent setup time and deteriorating job processing times

✍ Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Yang, Shanlin 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

Single-machine group scheduling with lin

Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times

✍ Ji-Bo Wang; Linyan Sun 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 264 KB

Single-machine scheduling with deteriora

Single-machine scheduling with deteriorating functions for job processing times

✍ T.C.E. Cheng; Wen-Chiung Lee; Chin-Chia Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Bicriterion Single Machine Scheduling wi

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

✍ Cheng, T. C. Edwin; Janiak, Adam; Kovalyov, Mikhail Y. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 389 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