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

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

โœ Scribed by Wen-Chiung Lee; Yu Shin Lin; Chin-Chia Wu

Publisher
Springer
Year
2009
Tongue
English
Weight
151 KB
Volume
47
Category
Article
ISSN
0268-3768

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

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

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit