Multi-machine Scheduling Problem with Optimal Due Interval Assignment Subject to Generalized sum Type Criterion
In this paper, we consider a multi-machine scheduling problem, in which to each job a due interval should be assigned. In the scientific literature of scheduling theory, only an assignment of due date was considered. However in our case, to each job a due interval should be assigned. Due interval is a generalization of classical due date and describes a time interval, in which a job should be finished. For the considered problem, we should find a schedule of jobs and a common due interval such that the sum of: the total tardiness, the total earliness and due interval parameters is minimized. We proved an ordinary NP-completeness of the problem using the well known NP-complete partition problem. A heuristic algorithm solving the problem with its experimental analysis is also presented.
KeywordsSchedule Problem Heuristic Algorithm Partition Problem Total Tardiness Single Machine Schedule Problem
Unable to display preview. Download preview PDF.
- 3.Garey M. R., Johnson D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San FranciscoGoogle Scholar
- 4.Graham R.L. (1969) Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263–369Google Scholar
- 6.Janiak A., Marek M. (2000) Single machine scheduling problem with optimal due intervals assignment. Lecture Notes of Silesian University, Automation 129, 145–155 (in Polish)Google Scholar