Modeling of a scheduling problem with expected availability of resources

作     者：Yellapu, Ganesh Penmetsa, Satish 

作者机构：Bharat Elect Ltd Cent Res Lab Bangalore 560013 Karnataka India 

出 版 物：《OPSEARCH》 (运筹学；印度运筹学会志)

年 卷 期：2015年第52卷第4期

页      面：771-781页

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：management of Central Research Laboratory  Bharat Electronics Limited 

主　　题：Binary integer programming Deadline Effort Offline setting Online setting Resource Resource calendar 

摘      要：A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availability is not continuous and described by a resource calendar, to be used to accomplish the jobs. Further the scheduling must be optimum and must comply various constraints. The proposed model is a typical binary integer programming problem for the scheduling problem subject to various constraints and hence it could be solved using the techniques of binary integer programming. One heuristic method is also discussed to solve the scheduling problem.