Rescheduling Problems with Deteriorating Jobs to Minimize the Tardiness Costs under Time Disruptions

Xin Gong Zhang

doi:10.4028/www.scientific.net/AMR.787.973

Paper Titles

3D Measurement of Anatomic Parameters and Development of a Digital Design to Improve the Outcome of Lower-Extremity Surgery
p.947

Fault Locating of Grounding Grids Based on Extreme Learning Machine Elman Neural Network
p.954

Study on the Method of Radar Servo System Faults Diagnosis Based on Expert System and Neural Network
p.959

Facial Diagnosis of Chinese Medical Syndromes of CHB and its Correlation with Liver Function
p.965

Rescheduling Problems with Deteriorating Jobs to Minimize the Tardiness Costs under Time Disruptions
p.973

Research and Implementation of Time Synchronization Protocol Based on the ZigBee
p.978

CANbus Hybrid Scheduling Algorithm Based on DMS and EDF
p.982

The Allocation and Statistics of Quota of Teaching-Practicing Normal Graduates: Based on Excel Built-in Function and VBA
p.987

Differences in the Usage of Information Systems Applied by the German and Hungarian Micro-Enterprises
p.991

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 787Rescheduling Problems with Deteriorating Jobs to...

Rescheduling Problems with Deteriorating Jobs to Minimize the Tardiness Costs under Time Disruptions

Abstract:

This paper studies the issue of rescheduling to allow for the unexpected arrival of new jobs, taking into account the effect of the disruptions on a previously planned optimal schedule. We consider the single-machine rescheduling problems with deteriorating jobs. Rescheduling means that a set of original jobs has already been scheduled to minimize some classical objective, then a new set of jobs arrives and creates a disruption. The objective is to minimize the total tardiness costs under a limit of the disruptions from the original scheduling. We propose polynomial time algorithms or some dynamic programming algorithms for each problem.

You might also be interested in these eBooks

Advanced Materials Researches, Engineering and Manufacturing Technologies in Industry

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 787)

Pages:

973-977

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.787.973

Citation:

Cite this paper

Online since:

September 2013

Authors:

Xin Gong Zhang

Keywords:

Deteriorating Jobs, Rescheduling, Scheduling, Single-Machine, Time Disruption, Total Tardiness

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Gupta J.N.D., Gupta S.K. Single facility scheduling with nonlinear processing times. Compt. Ind. Eng. 14: 387-393, (1988).

DOI: 10.1016/0360-8352(88)90041-1

Google Scholar

[2] J. -B. Wang, M. -Z. Wang, Single-machine scheduling with nonlinear deterioration, Optim. Lett. vol6, pp.87-98, (2012).

Google Scholar

[3] Gawiejnowicz S. Time-Dependent Scheduling, Springer, (2008).

Google Scholar

[4] Hall N.G., Potts C.N. Rescheduling for new orders. Oper. Res. vol52, pp.440-453, (2004).

Google Scholar

[5] Yuan J.J., Mu Y.D. Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur. J. Oper. Res. vol182, pp.936-944, (2007).

DOI: 10.1016/j.ejor.2006.07.026

Google Scholar

[6] Hall N.G., Potts C.N. Rescheduling for Job Unavailability. Oper. Res. vol58, pp.746-755, (2010).

Google Scholar

[7] Hoogeveen H., Lenté C., T'kindt V. Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res., vol223, pp.40-46, (2012).

DOI: 10.1016/j.ejor.2012.05.046

Google Scholar

[8] Du J., Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. vol15, pp.483-495, (1990).

DOI: 10.1287/moor.15.3.483

Google Scholar

[9] Kononov A., Gawiejnowicz S. NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. vol52, pp.708-717, (2001).

DOI: 10.1057/palgrave.jors.2601117

Google Scholar