Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity
Authors:
- 24 July 2015
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 54 (12) , 3475-3490
Abstract
In this paper, we consider common due-window assignment and scheduling problems with general position-dependent processing times involving deteriorating and compressible maintenance activity on a single machine. Two models associated with maintenance activity are examined in this article, in which the maintenance length is assumed to be either time-dependent and compressible or position-dependent and compressible. The objective is to find jointly the location and size of due-window, position of maintenance as well as resource amount allocated to it, and job sequence to minimise a total cost function based on earliness, tardiness, window location, window size and resource cost. We show that the problem considered in each of the two models’ setting can be optimally solved with polynomial time algorithm by reducing to assignment problem. Finally, two examples are provided to illustrate the solution procedures.Keywords
Funding Information
- National Natural Science Foundation of China (11301070,71390333)
This publication has 52 references indexed in Scilit:
- Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing timesInternational Journal of Production Research, 2013
- Single-machine common due window assignment and scheduling to minimize the total costDiscrete Optimization, 2013
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing timesComputers & Operations Research, 2012
- A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resourcesInternational Journal of Production Research, 2011
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespanApplied Mathematical Modelling, 2010
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobsNaval Research Logistics (NRL), 2009
- A due-window assignment problem with position-dependent processing timesJournal of the Operational Research Society, 2008
- A survey of scheduling with controllable processing timesDiscrete Applied Mathematics, 2007
- Scheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society, 1999
- Common due window size and location determination in a single machine scheduling problemJournal of the Operational Research Society, 1998