✦ LIBER ✦

Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

✍ Scribed by Ma, Ran; Yuan, Jinjiang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The single machine serial batch scheduli

✍ Shabtay, Dvir 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 468 KB

An FPTAS for Uniform Machine Scheduling

✍ Wu, Dan; Luo, Cheng Xin 📂 Article 📅 2013 🏛 Trans Tech Publications Inc. 🌐 English ⚖ 264 KB

A note on “An optimal online algorithm f

✍ Sheng Yu; Prudence W.H. Wong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 175 KB

The two-machine flowshop no-wait schedul

✍ Ling-Huey Su; Yuan-Yu Lee 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Single machine batch scheduling to minim

✍ Yin, Yunqiang; Ye, Deshi; Zhang, Guochuan 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 407 KB

On the single machine serial batching sc

✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan; Z.H. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB