"Flowshop scheduling problem to minimize total completion time with random ..."

Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai (2004)

> Home

Details and statistics

DOI: 10.1057/PALGRAVE.JORS.2601682

access: closed

type: Journal Article

metadata version: 2020-09-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jors/SotskovAL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jors/SotskovAL04
Yuri N. Sotskov, Ali Allahverdi, Tsung-Chyan Lai:
Flowshop scheduling problem to minimize total completion time with random and bounded processing times. J. Oper. Res. Soc. 55(3): 277-286 (2004)

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.