Hybrid Flowshop Scheduling with Finite Transportation Capacity

Hua Xuan

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

Paper Titles

Application of Grey Model(1,1) in Road Traffic Accident Forecast
p.551

Simulation of Goods Unloading Process Based on Queueing Network
p.557

Dynamic Hybrid Flowshop Scheduling with Batching Production
p.562

National Technological Innovation Output Capacity Forecast and its Influence Factors Analyses in China
p.568

Hybrid Flowshop Scheduling with Finite Transportation Capacity
p.574

Research on the Relationship between Controlling Shareholder and Accounting Conservatism in China
p.579

The Application of Self-Organizing Map (SOM) to Assess Power Communication Network Reliability
p.585

Performance Evaluation of a Massively Parallel Decoder for CISC Microprocessors
p.590

Application of Integrableware Information System in Orienteering Teaching
p.595

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 65Hybrid Flowshop Scheduling with Finite...

Hybrid Flowshop Scheduling with Finite Transportation Capacity

Abstract:

This paper studies a class of hybrid flowshop scheduling problem characterized by release time, transportation time and transportation capacity of one unit for each transporter. This problem is formulated as an integer programming model and a Lagrangian relaxation algorithm is designed to solve it. Testing results on problems of small to medium sizes show that the Lagrangian relaxation algorithm can obtain an acceptable near optimal schedule within a shorter CPU time.

You might also be interested in these eBooks

Mechatronic Systems and Automation Systems

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 65)

Pages:

574-578

DOI:

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

Citation:

Cite this paper

Online since:

June 2011

Authors:

Hua Xuan

Keywords:

Finite Transportation Capacity, Hybrid Flowshop, Lagrangian Relaxation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Soukhal, A. Oulamara, P. Martineau. Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research, 161 (2005), 32-41.

DOI: 10.1016/j.ejor.2003.03.002

Google Scholar

[2] Lixin Tang, Hua Gong. A hybrid two-stage transportation and batch scheduling problem. Applied Mathematical Modelling, 32 (2008), 2467–2479.

DOI: 10.1016/j.apm.2007.09.028

Google Scholar

[3] T.C.E. Cheng, XiuliWang. Machine scheduling with job class setup and delivery considerations. Computers & Operations Research, 37 (2010), 1123–1128.

DOI: 10.1016/j.cor.2009.10.001

Google Scholar

[4] Lixin Tang, Jing Guan, Guofen Hu. Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration. Computers & Industrial Engineering, 58 (2010), 239-248.

DOI: 10.1016/j.cie.2009.07.014

Google Scholar

[5] Oğuz C, and Tang L. A Lagrangian Relaxation method for hybrid flow-shop scheduling with multiprocessor tasks to minimize total weighted completion time. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, UK (2003).

Google Scholar