Thumbnail
Access Restriction
Open

Author Benyoucef, Lyès ♦ Penz, Bernard ♦ Kubiak, Wieslaw
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Dynamic Programming Approach ♦ Changeover Criterion ♦ Minimum Number ♦ Multi-product Single Machine Scheduling Problem ♦ Changeover Cost ♦ Different Type ♦ Unit Execution Time Job ♦ Product Type ♦ Multi-product Scheduling Problem ♦ Single Machine
Abstract We present a dynamic programming approach to a multi-product scheduling problem on one machine. A set of unit execution time jobs of different types has to be processed without preemption on a single machine. Each job must nish before its deadline and all deadlines are different. A changeover cost is incurred when the machine switches from one product type to another. The objective is to minimize the number of changeovers respecting all deadlines.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2000-01-01