✦ LIBER ✦

Minimizing flowtime and maximum earliness on a single machine

✍ Scribed by Murat Koksalan; Meral Azizoglu; Suna Koksalan Kondakci

Book ID: 110250514
Publisher: Taylor and Francis Group
Year: 1998
Tongue: English
Weight: 227 KB
Volume: 30
Category: Article
ISSN: 0740-817X
DOI: 10.1023/a:1007470302024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing flowtime and missed due-dates

Minimizing flowtime and missed due-dates in single-machine sequencing

✍ T.C.E. Cheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 593 KB

Minimizing maximum earliness and number

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

✍ Ehsan Molaee; Ghasem Moslehi; Mohammad Reisi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Lower bounds and algorithms for flowtime

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

Minimizing earliness and tardiness penal

Minimizing earliness and tardiness penalties in a single-machine problem with a common due date

✍ Celso M. Hino; Débora P. Ronconi; André B. Mendes 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Minimizing the number of tardy jobs and

Minimizing the number of tardy jobs and maximum earliness in the single machine scheduling using an artificial immune system

✍ Mohammad Reisi; Ghasem Moslehi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 186 KB

A moving block heuristic for minimizing

A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due dates

✍ Scott J. Mason; Song Jin; Jagadish Jampani 📂 Article 📅 2005 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 1013 KB

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial compu