"An efficient local search for minimizing completion time variance in ..."

Peeyush Mehta et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.COR.2011.06.020

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cor/MehtaPPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/MehtaPPS12
Peeyush Mehta, Pushkar Pandit, Deepu Philip, Prabha Sharma:
An efficient local search for minimizing completion time variance in permutation flow shops. Comput. Oper. Res. 39(5): 1000-1009 (2012)

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.