A comparison of due-date selection rules
暂无分享,去创建一个
Abstract In sequencing and scheduling models it is usually assumed that due dates represent exogeneous information. In many practical settings, however, due dates can be discretionary, or at least negotiable. Relatively few studies have incorporated discretionary due dates, and even then the rules proposed for due-date selection have seldom been developed from normative, analytic results. In this research we return to very basic scheduling models in search of fundamental insights and relationships that suggest guidelines for due-date selection in more complicated situations. We exploit some fundamental results from scheduling theory involving the single-machine model in order to compare three basic strategies for due-date selection.
[1] Jan Karel Lenstra,et al. Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..
[2] Samuel Eilon,et al. Due dates in job shop scheduling , 1976 .
[3] W. A. Horn. Some simple scheduling algorithms , 1974 .
[4] James K. Weeks. A Simulation Study of Predictable Due-Dates , 1979 .