Open Access Open Access  Restricted Access Subscription or Fee Access

Scheduling Jobs and A Variable Maintenance on A Single Machine with Common Due-window Assignment

Jianbo Gong, Long Wan, Wenchang Luo

Abstract


In this paper we investigate a common due-window assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness and due-window related costs. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a simple numerical example.

Keywords


scheduling, maintenance, common due-window assignment.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.