"A branch-and-bound algorithm for a single machine sequencing to minimize ..."

Reza Tavakkoli-Moghaddam et al. (2006)

> Home

Details and statistics

DOI: 10.1016/J.AMC.2005.05.011

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amc/Tavakkoli-MoghaddamMVA06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/Tavakkoli-MoghaddamMVA06
Reza Tavakkoli-Moghaddam, Ghasem Moslehi, M. Vasei, Amir Azaron:
A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. Appl. Math. Comput. 174(1): 388-408 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.