Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Industrial Engineering

Theses and Dissertations

Scheduling

Articles 1 - 2 of 2

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Heuristic Algorithms To Minimize Total Weighted Tardiness On The Single Machine And Identical Parallel Machines With Sequence Dependent Setup And Future Ready Time, Yue Xi May 2013

Heuristic Algorithms To Minimize Total Weighted Tardiness On The Single Machine And Identical Parallel Machines With Sequence Dependent Setup And Future Ready Time, Yue Xi

Theses and Dissertations

This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated …


Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely Sep 1993

Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely

Theses and Dissertations

This study examined the application of simple-to-use, low cost scheduling methods to the operating environment of a medium-sized manufacturing shop. Computer simulation was used to evaluate eighteen different scheduling algorithms, each the result of the combination of a loading and a sequencing rule; due date setting was not considered since due dates are exogenously set. The loading rules investigated were Minimum Machine Required, Lowest Average WIP, and Lowest Average Aggregate Priority Level. The sequencing rules investigated were Priority, EDD, FIS, SPT, Slack, and Slack Ratio. The scheduling algorithms were evaluated against performance measures of mean tardiness, mean flowtime, mean percentage …