Research Reports from the Department of Operations
Document Type
Report
Publication Date
5-1-1973
Abstract
The problem of sequencing n jobs on one machine is considered, under the multiple objective of minimizing mean flow time with the minimum number of tardy jobs. A simple procedure is first proposed to schedule for minimum flow time with a specified subset of jobs on time. This is used in conjunction with Moore's Algorithm in a simple heuristic producing good and often optimal schedules. A branch-bound algorithm is presented to produce the optimal schedule efficiently with the help of several theorems which eliminate much branching.
Keywords
Operations research, Production scheduling, Algorithms, Mathematical optimization, Business logistics
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 295
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Emmons, Hamilton, "One Machine Sequencing to Minimize Mean Flow Time with Minimum Number Tardy" (1973). Research Reports from the Department of Operations. 375.
https://commons.case.edu/wsom-ops-reports/375