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.

On the Multiple-Machine Extension to a Common Due-Date Assignment and Scheduling Problem

Prabuddha De, Jay B. Ghosh and Charles E. Wells
The Journal of the Operational Research Society
Vol. 42, No. 5 (May, 1991), pp. 419-422
DOI: 10.2307/2583755
Stable URL: http://www.jstor.org/stable/2583755
Page Count: 4
  • Subscribe ($19.50)
  • Cite this Item
On the Multiple-Machine Extension to a Common Due-Date Assignment and Scheduling Problem
Preview not available

Abstract

In a recent paper, Cheng considers the multiple-machine extension to a due-date assignment and scheduling problem. He implicitly assumes zero start times for all schedules (which does not ensure optimality), and overlooks the critical V-shape property for an optimal schedule (which leads him to over-estimate the effort needed to solve the problem). In this note, we correct these flaws, and also discuss the complexity of the problem and its special cases.

Page Thumbnails

  • Thumbnail: Page 
419
    419
  • Thumbnail: Page 
420
    420
  • Thumbnail: Page 
421
    421
  • Thumbnail: Page 
422
    422