Gordon, Valery S. and Strusevich, Vitaly A. (2009) Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198 (1). pp. 57-62. ISSN 0377-2217 (doi:https://doi.org/10.1016/j.ejor.2008.07.044)

Full text not available from this repository.

Abstract

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.

Item Type:	Article
Uncontrolled Keywords:	single machine scheduling, common due date assignment, SLK due date assignment, positionally dependent processing times
Subjects:	T Technology > T Technology (General) Q Science > QA Mathematics
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group
Related URLs:	Publisher Organisation
Last Modified:	14 Oct 2016 09:03
URI:	http://gala.gre.ac.uk/id/eprint/1305

Actions (login required)

View Item