A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration

Yu Ping Niu; Ji Bo Wang

doi:10.4028/www.scientific.net/AMM.513-517.2149

Paper Titles

Customer Arrival Event Processing on Computer Simulation for Discrete Event System
p.2133

Functional Structure and Technical Framework on University Scientific Research Management Platform
p.2137

An End-User Oriented Visual Programming Language
p.2141

Single Machine Group Scheduling Problem with Deteriorating Jobs and Release Dates
p.2145

A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration
p.2149

Note on Scheduling with the Exponential Learning and Simple Linear Deterioration
p.2153

An Improved Anycast QoS Routing Algorithm Based on Chaos Genetic Algorithm
p.2157

Research on Kernel Information Monitor Based on High-Privilege for Computer System
p.2161

Application of Data Mining in Construction of Corruption Risks Prevention System
p.2165

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517A Note on Flow Shop Scheduling with the Effects of...

A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration

Abstract:

In this note, we consider the machine scheduling problems with the effects of learning and deterioration. In this model, job processing times are defined by functions dependent on their starting times and positions in the sequence. The scheduling objectives are makespan, sum of completion times. It is shown that even with the introduction of learning effect and deterioration jobs to job processing times, several flow shop problems remain polynomially solvable.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

2149-2152

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.2149

Citation:

Cite this paper

Online since:

February 2014

Authors:

Yu Ping Niu*, Ji Bo Wang

Keywords:

Deteriorating Jobs, Flow Shop, Learning Effect

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Biskup D. A state-of-the-art review on scheduling with learning effects, European Journal of Operational Research, 188 (2008), 315-329.

DOI: 10.1016/j.ejor.2007.05.040

Google Scholar

[2] Gawiejnowicz S. Time-dependent scheduling. Springer, Berlin, (2008).

Google Scholar

[3] Lee W. -C. A note on deteriorating jobs and learning in single-machine scheduling problems, International Journal of Business and Economics, 3 (2004), 83-89.

Google Scholar

[4] Mosheiov G. Scheduling jobs under simple linear deterioration, Computers and Operations Research, 21 (1994), 653-659.

DOI: 10.1016/0305-0548(94)90080-9

Google Scholar

[5] Mosheiov G. Scheduling problems with a learning effect, European Journal of Operational Research, 132 (2001), 687-693.

DOI: 10.1016/s0377-2217(00)00175-2

Google Scholar

[6] Xiang S, Tang G, Cheng TCE, Solvable cases of permutation flowshop scheduling with dominating machines, International Journal of Production Economics, 66 (2000), 53-57.

DOI: 10.1016/s0925-5273(99)00106-1

Google Scholar

[7] Wang J-B, Single-machine scheduling problems with the effects of learning and deterioration, Omega, 35 (2007), 397-402.

DOI: 10.1016/j.omega.2005.07.008

Google Scholar

[8] Wang X, Cheng TCE, Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan, European Journal of Operational Research, 178 (2007), 57-70.

DOI: 10.1016/j.ejor.2006.01.017

Google Scholar