Single-Machine Scheduling with Due-Window Assignment and Rate-Modifying-Activities under a Deteriorating Maintenance

This paper studies single-machine scheduling problems with a due-window assignment and a rate-modifying activity under a deteriorating maintenance consideration simultaneously. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The main...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 278-280; pp. 2248 - 2251
Main Author Luo, Cheng Xin
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 01.01.2013
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper studies single-machine scheduling problems with a due-window assignment and a rate-modifying activity under a deteriorating maintenance consideration simultaneously. Jobs completed within the due-window incur no penalties, other jobs incur either earliness or tardiness penalties. The maintenance activity can be scheduled immediately after any one of the completed jobs. We assume that once the maintenance activity has been completed, the machine efficiency will be improved and the machine maintenance duration depends on its starting time. The objective is to find the optimal maintenance position as well as the optimal size and location of the due-window, and the sequence of jobs to minimize a cost function based on the window size and window location and the earliness and tardiness of the jobs. We propose a polynomial time algorithm to solve the problem optimally.
Bibliography:Selected, peer reviewed papers from the 2012 International Conference on Mechatronics and Control Engineering (ICMCE 2012), November 29-30, 2012, Guangzhou, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISBN:9783037855959
3037855959
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.278-280.2248