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

Cheng Xin Luo

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

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 Due-Window Assignment Based on Common Flow...

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

Abstract:

This paper studies a due-window assignment problem on a single machine. The job-dependent due-windows are obtained by the common flow allowance criterion. We assume that the processing time of a job is a linear function of its starting time and decreasing function of the resource amount assigned to it. The objective is to find the optimal size and location of the due-windows, the sequence of jobs and resource allocation scheme to minimize a cost function based on the window size and location, the earliness and tardiness of jobs and resource cost. 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:

275-278

DOI:

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

Citation:

Cite this paper

Online since:

July 2013

Authors:

Cheng Xin Luo

Keywords:

Due-Window Assignment, Flow Allowance, Linear Deteriorating, Resource Allocation, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

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

DOI: 10.1057/palgrave.jors.2600601

Google Scholar

[2] Mosheiov, G., Oron, D., job-dependent due-window assignment based on common flow allowance, Foundations of computing and decision sciences, Vol. 35(2010) , pp.185-195.

Google Scholar

[3] Cai-Min Wei, Ji-Bo Wang, Ping Ji, Single-machine scheduling with time-and-resource-dependent processing times, Applied Mathematical Modelling, Vol. 36(2012), pp.792-798.

DOI: 10.1016/j.apm.2011.07.005

Google Scholar

[4] A. Janiak, Optimal resource allocation for single-machine scheduling problems with time and resource dependent processing times, System Science, Vol. 28(2002), pp.85-94.

Google Scholar

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

Google Scholar

[6] Mosheiov, G., Oron, D., scheduling a maintenance activity and due-date assignment based on common flow allowance, Int. J. Production Economics, Vol. 135(2012), pp.222-230.

DOI: 10.1016/j.ijpe.2011.07.013

Google Scholar