### Abstract

n independent jobs are to be scheduled nonpreemptively on a single machine so as to minimize some performance measure. Federgruen and Mosheiov [2] show that a large class of such scheduling problems can be optimized by solving either a single instance or a finite sequence of instances of the so-called SQC problem, in which all the jobs have a fixed or controllable common due date and the sum of general quasiconvex functions of the job completion times is to be minimized. In this note we point out that this is not always true. In particular, we show that the algorithm proposed in [2] does not always find a global optimal schedule to the problem of minimizing the weighted sum of the mean and variance of job completion times.

Original language | English (US) |
---|---|

Pages (from-to) | 313-318 |

Number of pages | 6 |

Journal | Naval Research Logistics |

Volume | 43 |

Issue number | 2 |

DOIs | |

State | Published - Jan 1 1996 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Modeling and Simulation
- Ocean Engineering
- Management Science and Operations Research

### Cite this

}

**Note : "Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems".** / Weng, Michael X.; Ventura, Jose Antonio.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Note

T2 - "Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems"

AU - Weng, Michael X.

AU - Ventura, Jose Antonio

PY - 1996/1/1

Y1 - 1996/1/1

N2 - n independent jobs are to be scheduled nonpreemptively on a single machine so as to minimize some performance measure. Federgruen and Mosheiov [2] show that a large class of such scheduling problems can be optimized by solving either a single instance or a finite sequence of instances of the so-called SQC problem, in which all the jobs have a fixed or controllable common due date and the sum of general quasiconvex functions of the job completion times is to be minimized. In this note we point out that this is not always true. In particular, we show that the algorithm proposed in [2] does not always find a global optimal schedule to the problem of minimizing the weighted sum of the mean and variance of job completion times.

AB - n independent jobs are to be scheduled nonpreemptively on a single machine so as to minimize some performance measure. Federgruen and Mosheiov [2] show that a large class of such scheduling problems can be optimized by solving either a single instance or a finite sequence of instances of the so-called SQC problem, in which all the jobs have a fixed or controllable common due date and the sum of general quasiconvex functions of the job completion times is to be minimized. In this note we point out that this is not always true. In particular, we show that the algorithm proposed in [2] does not always find a global optimal schedule to the problem of minimizing the weighted sum of the mean and variance of job completion times.

UR - http://www.scopus.com/inward/record.url?scp=4243136274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243136274&partnerID=8YFLogxK

U2 - 10.1002/(SICI)1520-6750(199603)43:2<313::AID-NAV10>3.0.CO;2-W

DO - 10.1002/(SICI)1520-6750(199603)43:2<313::AID-NAV10>3.0.CO;2-W

M3 - Article

AN - SCOPUS:4243136274

VL - 43

SP - 313

EP - 318

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 2

ER -