A note on "minimizing a weighted quadratic function of job lateness in the single machine system"

H.M. Soroush

International Journal of Production Economics, 2009, vol. 121, issue 1, 296-297

Abstract: A set of jobs is to be scheduled on a single machine where an idle time is allowed to be inserted before the processing of the first job begins. The objective is to find an optimal sequence that minimizes the weighted sum of a quadratic function of job lateness. Sen et al. [Sen, T., Dileepan, P., Lind, M.R., 1995. Minimizing a weighted quadratic function of job lateness in the single machine system. International Journal of Production Economics 42(3), 237-243] presented a branch-and-bound algorithm for the problem; however, as shown in this note, their algorithm does not work because the branching rule for adjacent jobs is not applicable to non-adjacent jobs.

Keywords: Scheduling; Single; machine; Quadratic; lateness; Idle; time; Branch; and; bound (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00181-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:121:y:2009:i:1:p:296-297

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().