✦ LIBER ✦

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

✍ Scribed by Shiqing Yao; Zhibin Jiang; Na Li

Book ID: 113553707
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 735 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.06.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A memetic algorithm for minimizing total

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

✍ Tsung-Che Chiang; Hsueh-Chien Cheng; Li-Chen Fu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Minimizing total tardiness on a batch pr

Minimizing total tardiness on a batch processing machine with incompatible job families

✍ Sanjay V. Mehta; Reha Uzsoy 📂 Article 📅 1998 🏛 Taylor and Francis Group 🌐 English ⚖ 270 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 method for minimizing t

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

✍ Rabia Nessah; Imed Kacem 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 252 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

A branch-and-bound algorithm for a singl

A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

✍ Yin, Yunqiang; Wu, Wen-Hung; Wu, Wen-Hsiang; Wu, Chin-Chia 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 962 KB