"A permutation flow-shop scheduling problem with convex models of operation ..."

T. C. Edwin Cheng, Adam Janiak (2000)

> Home

Details and statistics

DOI: 10.1023/A%3A1018943300630

access: closed

type: Journal Article

metadata version: 2020-08-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/anor/ChengJ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/ChengJ00
T. C. Edwin Cheng, Adam Janiak:
A permutation flow-shop scheduling problem with convex models of operation processing times. Ann. Oper. Res. 96(1-4): 39-60 (2000)

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.