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 Problems with General Breakdowns, Earliness and Tardiness Costs

A. Federgruen and G. Mosheiov
Operations Research
Vol. 45, No. 1 (Jan. - Feb., 1997), pp. 66-71
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171926
Page Count: 6
  • Download ($30.00)
  • Cite this Item
Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
Preview not available

Abstract

In this paper we consider single machine scheduling problems with a common due-date for all jobs, arbitrary monotone earliness and tardiness costs and arbitrary breakdown and repair processes. We show that the problem is equivalent to a deterministic one without breakdowns and repairs and with an equivalent cost function of a job's completion time. A V-shaped schedule without idle times is shown to be optimal, if this equivalent cost function is quasi-convex. Conversely, we show that a V-shaped schedule may fail to be optimal if the property does not apply. We derive general conditions for the earliness and tardiness cost structure and repair and breakdown processes under which the equivalent cost function is quasi-convex. When a V-shaped schedule is optimal, an efficient (though pseudo-polynomial) algorithm can be used to compute an optimal schedule.

Page Thumbnails

  • Thumbnail: Page 
66
    66
  • Thumbnail: Page 
67
    67
  • Thumbnail: Page 
68
    68
  • Thumbnail: Page 
69
    69
  • Thumbnail: Page 
70
    70
  • Thumbnail: Page 
71
    71