A branch and bound algorithm for minimizing weighted completion times with deadlines
From MaRDI portal
Publication:3835632
DOI10.1080/02331939308843913zbMath0818.90063WikidataQ57634031 ScholiaQ57634031MaRDI QIDQ3835632
Publication date: 20 April 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939308843913
Related Items
Cites Work
- Unnamed Item
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
- Minimizing Weighted Completion Times with Deadlines