๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A branch and bound algorithm for scheduling jobs with

โœ Scribed by Kailiang Xu; Zuren Feng; Liangjun Ke

Publisher
Springer US
Year
2010
Tongue
English
Weight
550 KB
Volume
181
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and bound algorithm for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
โœ Theodore G. Voutsinas; Costas P. Pappis ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the

A branch-and-bound algorithm with fuzzy
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
โœ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi