✦ LIBER ✦

Simple heuristic to minimize total tardiness in a single machine scheduling problem

✍ Scribed by R. Panneerselvam

Publisher: Springer
Year: 2005
Tongue: English
Weight: 106 KB
Volume: 30
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-005-0102-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic procedure to minimize number

A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling

✍ Gursel A. Suer; Zbigniew Czajkiewicz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Minimizing total tardiness in a stochast

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

✍ Débora P. Ronconi; Warren B. Powell 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 491 KB

Single machine scheduling to minimize me

Single machine scheduling to minimize mean absolute lateness: A heuristic solution

✍ Timothy D. Fry; Ronald D. Armstrong; L. Drew Rosen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 688 KB

AnO(n2) algorithm for scheduling equal-l

AnO(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

✍ Zhongjun Tian; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 423 KB

A hybrid algorithm for the one machine s

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

✍ V. Srinivasan 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A meta-heuristic approach to single mach

A meta-heuristic approach to single machine scheduling problems

✍ R. Maheswaran; S.G. Ponnambalam; C. Aravindan 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 174 KB