Single machine scheduling with general positional deterioration and rate-modifying maintenance
Rustogi, Kabir and Strusevich, Vitaly A. (2012) Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40 (6). pp. 791-804. ISSN 0305-0483 (doi:10.1016/j.omega.2011.12.007)Full text not available from this repository.
We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group.
|Additional Information:|| Published in Omega, Volume 40, Issue 6, December 2012, Pages 791–804. Special Issue on Forecasting in Management Science.|
|Uncontrolled Keywords:||scheduling, maintenance, sequencing, deterioration, single machine, assignment problem|
|Subjects:||Q Science > QA Mathematics
T Technology > T Technology (General)
|School / Department / Research Groups:||School of Computing & Mathematical Sciences
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences > Department of Mathematical Sciences
|Last Modified:||09 Sep 2013 11:51|
Actions (login required)