✦ LIBER ✦

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints

✍ Scribed by C.T Ng; T.C.E Cheng; J.J Yuan

Book ID: 108410439
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 73 KB
Volume: 30
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(01)00105-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the single machine serial batching sc

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

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

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

Scheduling jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB