✦ LIBER ✦

Minmax due-date assignment with a time window for acceptable lead-times

✍ Scribed by Gerstl, Enrique; Mosheiov, Gur

Book ID: 121593598
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 456 KB
Volume: 211
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-013-1458-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note: Minmax due-date assignment probl

A note: Minmax due-date assignment problem with lead-time cost

✍ Mor, Baruch; Mosheiov, Gur; Shabtay, Dvir 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 179 KB

A due-window assignment problem with pos

A due-window assignment problem with position-dependent processing times

✍ Mosheiov, G; Sarig, A 📂 Article 📅 2008 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 128 KB

Hybrid meta-heuristic algorithm for job

Hybrid meta-heuristic algorithm for job shop scheduling with due date time window and release time

✍ Kuo, R. J.; Cheng, W. C. 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 294 KB

Optimal due-date assignment for a single

Optimal due-date assignment for a single machine sequencing problem with random processing times

✍ CHENG, T. C. E. 📂 Article 📅 1986 🏛 Taylor and Francis Group 🌐 English ⚖ 206 KB

Approximations for the time spent in a d

Approximations for the time spent in a dynamic job shop with applications to due-date assignment

✍ SHANTHIKUMAR, J. GEORGE; SUMITA, USHIO 📂 Article 📅 1988 🏛 Taylor and Francis Group 🌐 English ⚖ 680 KB

Two due date assignment problems with po

Two due date assignment problems with position-dependent processing time on a single-machine

✍ Chou-Jung Hsu; Suh-Jenq Yang; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing