Gordon, V.S. and Strusevich, V.A. (2008) Schedules with due-date assignment and position-dependent processing times. Doklady of the National Academy of Sciences of Belarus, 52 (5). pp. 24-30. ISSN 0002-354X

Full text not available from this repository.

Abstract

Single machine scheduling problems are considered, in which the processing of jobs depend on positions of the jobs in a schedule and the due-dates are assigned either according to the CON rule (a due-date common to all jobs is chosen) or according to the SLK rule (the due-dates are computed by increasing the actual processing times of each job by a slack, common to all jobs). Polynomial-time dynamic programming algorithms are proposed for the problems with the objective functions that include the cost of assigning the due-dates, the total cost of disgarded jobs (which are not scheduled) and, possibly, the total earliness of the scheduled jobs.

Item Type:	Article
Additional Information:	[1] This paper is written in Russian. [2] Journal has alternative title in Russian: Doklady Natsionalnoi Akademii Nauk Belarusi.
Uncontrolled Keywords:	single machine scheduling
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Related URLs:	Publisher Publisher
Last Modified:	14 Oct 2016 09:03
URI:	http://gala.gre.ac.uk/id/eprint/1215

Actions (login required)

View Item