✦ LIBER ✦

Improving the preemptive bound for the single machine dynamic maximum lateness problem

✍ Scribed by F. Della Croce; V. T’kindt

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 194 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2010.08.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing maximal regret in the single

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

✍ Adam Kasperski 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 170 KB

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied proble

Heuristics for the two-machine flowshop

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Improved complexity bound for the maximu

Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Dynamic programming and decomposition ap

Dynamic programming and decomposition approaches for the single machine total tardiness problem

✍ C.N. Potts; L.N. Van Wassenhove 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 909 KB

An improved dynamic programming algorith

An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

✍ Jose A. Ventura; Michael X. Weng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB