Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

Journal Article

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

Graham McMahon and Michael Florian
Operations Research
Vol. 23, No. 3 (May - Jun., 1975), pp. 475-482
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169697
Page Count: 8

You can always find the topics here!

Topics: Mathematical problems, Scheduling, Sequencing, Optimal solutions
Were these topics helpful?
See something inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Download ($30.00)
  • Add to My Lists
  • Cite this Item
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Preview not available

Abstract

An algorithm is developed for sequencing jobs on a single processor in order to minimize maximum lateness, subject to ready times and due dates. The method that we develop could be classified as branch-and-bound. However, it has the unusual feature that a complete solution is associated with each node of the enumeration tree.

Page Thumbnails

  • Thumbnail: Page 
475
    475
  • Thumbnail: Page 
476
    476
  • Thumbnail: Page 
477
    477
  • Thumbnail: Page 
478
    478
  • Thumbnail: Page 
479
    479
  • Thumbnail: Page 
480
    480
  • Thumbnail: Page 
481
    481
  • Thumbnail: Page 
482
    482