Single machine scheduling and due date assignment with positionally dependent processing times
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-2217Full text not available from this repository.
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.
|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
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
School of Computing & Mathematical Sciences > Statistics & Operational Research Group
|Last Modified:||21 Mar 2012 15:24|
Actions (login required)