✦ LIBER ✦

Augmentations of consistent partial orders for the one-machine total tardiness problem

✍ Scribed by Wenci Yu

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 886 KB
Volume: 68
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00051-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Worst-case analysis of local search heur

Worst-case analysis of local search heuristics for the one-machine total tardiness problem

✍ Shiwei Chang; Hirofumi Matsuo; Guochun Tang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Algorithms for special cases of the sing

Algorithms for special cases of the single machine total tardiness problem and an application to the even–odd partition problem

✍ Alexander A. Lazarev; Frank Werner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 908 KB

Further study of minimizing total tardin

Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models

✍ Po-Chieng Hu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 194 KB

On the CAUCHY Problem for Non-linear Par

On the CAUCHY Problem for Non-linear Partial Differential-functional Equations of the First Order

✍ Zdzisław Kamont 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 584 KB

On an algorithm for the solution of Cauc

On an algorithm for the solution of Cauchy's problem for partial differential equations of the first order

✍ A.N. Filatov 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 330 KB