首页 | 本学科首页   官方微博 | 高级检索  
     


Safe scheduling: Setting due dates in single-machine problems
Authors:Kenneth R. Baker  Dan Trietsch
Affiliation:1. Tuck School, Dartmouth College, Hanover, NH 03755, USA;2. College of Engineering, American University of Armenia, Yerevan, Armenia
Abstract:We consider single-machine stochastic scheduling models with due dates as decisions. In addition to showing how to satisfy given service-level requirements, we examine variations of a model in which the tightness of due-dates conflicts with the desire to minimize tardiness. We show that a general form of the trade-off includes the stochastic E/T model and gives rise to a challenging scheduling problem. We present heuristic solution methods based on static and dynamic sorting procedures. Our computational evidence identifies a static heuristic that routinely produces good solutions and a dynamic rule that is nearly always optimal. The dynamic sorting procedure is also asymptotically optimal, meaning that it can be recommended for problems of any size.
Keywords:Scheduling   Stochastic scheduling   Heuristics   Due-date setting
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号