Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Branch-and-bound algorithms for scheduling in permutation flowshops to ..."

N. Madhushini, Chandrasekharan Rajendran, Y. Deepa (2009)

> Home

Details and statistics

DOI: 10.1057/PALGRAVE.JORS.2602642

access: closed

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jors/MadhushiniRD09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jors/MadhushiniRD09
N. Madhushini, Chandrasekharan Rajendran, Y. Deepa:
Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs. J. Oper. Res. Soc. 60(7): 991-1004 (2009)

a service of

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.