"Bounds for the permutation flowshop scheduling problem with exact time ..."

Imen Hamdi (2014)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition @ ijcopi.org
- export record
  dblp key:
  - journals/ijcopi/Hamdi14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcopi/Hamdi14
Imen Hamdi:
Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness. Int. J. Comb. Optim. Probl. Informatics 5(2): 47-57 (2014)

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.