Research Reports from the Department of Operations
Document Type
Report
Publication Date
8-1-1986
Abstract
We consider scheduling a set of jobs on parallel processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. For identical processors, the secondary criteria of minimizing makespan and machine occupancy are addressed. The extension to different, uniform processors is also solved.
Keywords
Operations research, Scheduling--Mathematical models, Production scheduling, Mathematical optimization, Parallel processing (Electronic computers), Cost effectiveness, Multimachine assignments
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 578
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Emmons, Hamilton, "Scheduling to a Common Due Date on Parallel Uniform Processors" (1986). Research Reports from the Department of Operations. 501.
https://commons.case.edu/wsom-ops-reports/501