Research Reports from the Department of Operations

Document Type

Report

Publication Date

9-1-1983

Abstract

Jobs with random processing times, random due dates, and weights are to be scheduled on parallel machines so as to minimize the expected total weight of tardy jobs. Under various assumptions, optimal policies are presented both for static lists and dynamic schedules, preemptive and nonpremptive. The effect of processing time variability is also investigated.

Keywords

Stochastic processes, Operations research, Production scheduling, Parallel processing (Electronic computers), Algorithms, Decision making--Mathematical models, Industrial management

Publication Title

Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University

Issue

Technical memorandum no. 529

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.