✦ LIBER ✦

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time

✍ Scribed by H.A.J. Crauwels; A.M.A. Hariri; C.N. Potts; L.N. Van Wassenhove

Book ID: 110379531
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 170 KB
Volume: 83
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018920416308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search heuristics for single machi

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time

✍ H.A.J. Crauwels; C.N. Potts; L.N. Van Wassenhove 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 75 KB

Approximation algorithms for single-mach

Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times

✍ Stanisłlaw Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An improved branch and bound algorithm f

An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

✍ Yunpeng Pan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Branch-and-bound and simulated annealing

Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready times and learning effect

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Juei-Chao Chen; Nae-Sheng Wang; Wen-Hung Wu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 211 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

Completion times algorithm of multi-prod

Completion times algorithm of multi-product batch processes for common intermediate storage policy (CIS) with nonzero transfer and set-up times

✍ J.H. Jung; H.-K. Lee; I.-B. Lee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB