An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (Q3783064)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime |
scientific article; zbMATH DE number 4045466 |
Statements
An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime (English)
0 references
1988
0 references
branch and bound
0 references
n job, m parallel machine problem
0 references
weighted flowtime criterion
0 references
improved lower bound
0 references
0.8539801239967346
0 references
0.8525575995445251
0 references
0.8424948453903198
0 references
0.8307251930236816
0 references
A branch and bound procedure to solve the n job, m parallel machine problem for the weighted flowtime criterion has been developed by \textit{S. E. Elmaghraby} and \textit{S. H. Park} [AIEE Transactions 6, No.1 (1974)] and further modified by \textit{J. W. Barnes} and \textit{J. J. Brennan} [ibid. 9, No.1 (1977)]. This paper proposes a branching scheme different from theirs and shows its superiority. Also, some new and simple results are presented which are easy to implement to obtain an efficient branch-and- bound algorithm. In addition, a new and improved lower bound is developed which is easy to compute.
0 references