Optimal Common Due-Window Assignment with Linear Deteriorating and Resource-Dependent Processing Times under a Deteriorating Maintenance Activitiy

Cheng Xin Luo

doi:10.4028/www.scientific.net/AMM.344.290

Paper Titles

Research on CGF Decision-Making Algorithm Based on Fuzzy Petri Nets
p.253

Research on a Method of Service-Oriented Network Layer Network Security Situation Assessment
p.260

Coordination Algorithm Design of the Load Sharing Proxy Servers for Streaming Media
p.265

Developing and Applying the Information Construction Analysis Visualization System
p.270

Optimal Due-Window Assignment Based on Common Flow Allowance under Linear Deteriorating and Resource-Dependent Processing Times
p.275

An Intelligent Approach for Reactive Power Planning in Distribution Network with Wind Power
p.279

Application of Workflow Technology in the CAPP System
p.285

Optimal Common Due-Window Assignment with Linear Deteriorating and Resource-Dependent Processing Times under a Deteriorating Maintenance Activitiy
p.290

Research on Method of Property Verification of Multi-Agent System CGF Architecture Model
p.294

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 344Optimal Common Due-Window Assignment with Linear...

Optimal Common Due-Window Assignment with Linear Deteriorating and Resource-Dependent Processing Times under a Deteriorating Maintenance Activitiy

Abstract:

This paper studies single-machine scheduling problems with a due-window assignment under a deteriorating maintenance and time-and-resource-dependent processing times. 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 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 maintenance position, the size and location of the due-window, and the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location and the earliness and tardiness of jobs and resource. We propose an algorithm to solve the problem.

You might also be interested in these eBooks

Advanced Research on Applied Mechanics, Mechatronics and Intelligent System

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 344)

Pages:

290-293

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.344.290

Citation:

Cite this paper

Online since:

July 2013

Authors:

Cheng Xin Luo

Keywords:

Deterioration, Due-Window Assignment, Maintenance Activity, Resource Allocation, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] SD Liman, S. S Panwalkar et al, Common due-window size and location determination in a single machine scheduling problem, Journal of the Operational Research Society, 49 (1998) 1007-1010.

DOI: 10.1057/palgrave.jors.2600601

Google Scholar

[2] Chen, W. -J., Omega, 37 (2009) 591-599.

Google Scholar

[3] Gawiejnowicz S., European Journal of Operational Research, 180 (2007) 472-478.

Google Scholar

[4] Yang, S. -J. and Yang, D. -L., Omega, 38 (2010) 528-533.

Google Scholar

[5] Cai-Min Wei, Ji-Bo Wang, Ping Ji, Applied Mathematical Modelling, 36 (2012) 792-798.

Google Scholar

[6] A. Janiak, System Science, 28 (2002)85-94.

Google Scholar

[7] Graham, R. L. et al. Annals of Discrete Mathematics, 5 (1979) 287-326.

Google Scholar

[8] T. C. E. Cheng, Suh-Jenq Yang, Dar-Li Yang, Int. J. Production Economics, 135(2012)154-161.

Google Scholar