An Algorithm of Simple Multi-Product Scheduling Problem with No-Wait Constraint between Operations

Zhi Qiang Xie; Jing Yang; Yu Jing He; Zhi Min Li

doi:10.4028/www.scientific.net/AMR.129-131.902

Paper Titles

Design and Implementation of the Block Cipher-SMS4 IP Core
p.881

Effect of Solution Annealing on Microstructure and Mechanical Properties of MIM Fe-Cr-Mn-Mo-N Stainless Steels
p.886

Source(s) Identification of Variance Shifts in Bivariate Process Using LS-SVM Based Pattern Recognition Model
p.891

Dynamic Integrated Scheduling Algorithm of Complex Multi-Products with Identical Machines
p.897

An Algorithm of Simple Multi-Product Scheduling Problem with No-Wait Constraint between Operations
p.902

Three-Dimensioned Extrusion Simulation and Analysis of Bending Aluminum-Alloy Tube Based on Deform Software
p.908

Constitutive Equation of Ti-6Al-3.5Mo Titanium Alloy at High Temperature
p.916

Performance and Reliability Analysis of Bundled SWCNT as IC Interconnects
p.920

Research of Electrical and Hydration Behavior of Phosphoaluminate Cementitious Material
p.926

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 129-131An Algorithm of Simple Multi-Product Scheduling...

An Algorithm of Simple Multi-Product Scheduling Problem with No-Wait Constraint between Operations

Abstract:

Considering the simple multi-product scheduling problem that there is no-wait constraint between operations, an algorithm is presented which combines the ACPM (allied critical path method) and BFSM (best fit scheduling method) scheduling algorithm. In this algorithm the operations with no-wait constraint and finish-to-start constraint can be converted into a virtual operation. So the scheduling problem with no-wait constraint can be converted into the scheduling problem without no-wait constraint operations but with virtual operations. Then the movement and adjustment algorithm is adopted to sequence the operations which are converted into virtual operation on corresponding machines. So the problem with no-wait constraint between operations can be resolved. Example shows that the method with virtual operations and the movement and adjustment algorithm presented by this paper can be easy to realize, and favorable results can be obtained.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 129-131)

Pages:

902-907

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.129-131.902

Citation:

Cite this paper

Online since:

August 2010

Authors:

Zhi Qiang Xie, Jing Yang, Yu Jing He, Zhi Min Li

Keywords:

Adjustment Algorithm, Movement Algorithm, No-Wait Constraint, Scheduling Algorithm, Simple Multi-Product, Virtual Operation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Z.Q. Xie, Z.M. Li, S.Z. Hao, G.Y. Tan. Study on Complex Product Scheduling Problem with No-wait Constraint between Operations. Acta Automatica Sinica, 2009, 35(7): 983-989.

DOI: 10.3724/sp.j.1004.2009.00983

Google Scholar

[2] Z.Q. Xie, S.H. Liu, P.L. Qiao. Dynamic Job-shop Scheduling Algorithm Based on ACPM and BFSM. Journal of Computer Research and Development, 2003, 40(7): 976-983.

Google Scholar

[3] O. HOLTHAUS. Scheduling in job shops with machine breakdowns: an experimental study. Computers & Industrial Engineering, 1999, 36 (1): 137-162.

DOI: 10.1016/s0360-8352(99)00006-6

Google Scholar

[4] H.G. Xiong, J.J. Li ,J.Y. Kong. Heuristic Method for Dynamic Job shop Scheduling Problem With Operation Relativity. Chinese Journal of Mechanical Engineering, 2006, 42(8): 50-55.

DOI: 10.3901/jme.2006.08.050

Google Scholar

[5] Z.Q. Xie, T. Mo, G.Y. Tan. Dynamic Job-shop Scheduling Algorithm of the Non-close-joining Operations. Chinese Journal of Mechanical Engineering, 2008, 44(1): 155-160.

DOI: 10.3901/jme.2008.01.155

Google Scholar