Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Single Machine Scheduling with Flow Allowances

George I. Adamopoulos and Costas P. Pappis
The Journal of the Operational Research Society
Vol. 47, No. 10 (Oct., 1996), pp. 1280-1285
DOI: 10.2307/3010040
Stable URL: http://www.jstor.org/stable/3010040
Page Count: 6
  • Subscribe ($19.50)
  • Cite this Item
Single Machine Scheduling with Flow Allowances
Preview not available

Abstract

In this paper, a set of jobs is scheduled using the SLK due-date determination method, according to which all the jobs are given the same flow allowance. The single machine case is considered. The objective function is a cost function including three components, namely flow allowance and weighted earliness and tardiness. An analytical solution is given and an algorithm, which provides optimal solutions, is presented. Finally, the parallel machines case is discussed.

Page Thumbnails

  • Thumbnail: Page 
[1280]
    [1280]
  • Thumbnail: Page 
1281
    1281
  • Thumbnail: Page 
1282
    1282
  • Thumbnail: Page 
1283
    1283
  • Thumbnail: Page 
1284
    1284
  • Thumbnail: Page 
1285
    1285