✦ LIBER ✦

An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem

✍ Scribed by Liaw, Ching-Fang

Book ID: 124076564
Publisher: Informa UK (Taylor & Francis)
Year: 2013
Tongue: English
Weight: 323 KB
Volume: 30
Category: Article
ISSN: 2168-1015
DOI: 10.1080/21681015.2013.843596

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An optimal online algorithm for two-mach

An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times

✍ Ming Liu; Chengbin Chu; Yinfeng Xu; Feifeng Zheng 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

A Branch-and-Bound Algorithm for the Con

A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem

✍ Bozoki, George; Richard, Jean-Paul 📂 Article 📅 1970 🏛 Taylor and Francis Group 🌐 English ⚖ 430 KB

A branch-and-bound and heuristic algorit

A branch-and-bound and heuristic algorithm for the single-machine time-dependent scheduling problem

✍ Wen-Chiung Lee; Yu Shin Lin; Chin-Chia Wu 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 151 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

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b