Online Scheduling with Incompatible Job Families on Batch Processing Machine(s)

Li Li Liu

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

Paper Titles

Study on Formative Industry Design with the Impact of Gestalt Psychology on Modeling Cognitive
p.392

Intelligence Based Control Strategy of Forming Process for Plastic & Rubber Products
p.396

Research on the Measuring of the Order of Eco-Industrial Chains for Recycling Waste Material Based on the Theory of Dissipative Structure
p.400

Research on Mechanical Operation with Sequencing Optimization of Arrival Aircraft in Terminal Area
p.404

Online Scheduling with Incompatible Job Families on Batch Processing Machine(s)
p.408

Mechanical and Electrical Integration of Workpiece Transfer System
p.412

Research on Mechanical Design with Beidou GPS Navigation Antenna Design Terminal
p.416

Research on Development Potential of the New Energy Industry Based on Fuzzy Comprehensive Evaluation
p.421

The Focusing Mechanism Design for Laser Anti-Counterfeit Platform in Production Manufacturing Engineering
p.425

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 345Online Scheduling with Incompatible Job Families...

Online Scheduling with Incompatible Job Families on Batch Processing Machine(s)

Abstract:

This paper considers online scheduling with incompatible job families on single batch processing machine and parallel batchprocessing machines. Online algorithm is developed and the performance ratio of the algorithm is analyzed for the problem under consideration, respectively.

You might also be interested in these eBooks

Advanced Research on Mechanical Engineering, Industry and Manufacturing Engineering III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 345)

Pages:

408-411

DOI:

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

Citation:

Cite this paper

Online since:

August 2013

Authors:

Li Li Liu

Keywords:

Batch Processing Machine, Online, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P. Brucker, A. Gladky, H. Hoogevreen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, S. Van deVelde: Scheduling a batching machine. Journal of Scheduling, Vol. 1(1998), pp.31-54.

DOI: 10.1002/(sici)1099-1425(199806)1:1<31::aid-jos4>3.0.co;2-r

Google Scholar

[2] L.L. Liu, C.T. Ng and T.C.E. Cheng: On the complexity of bi-criteria scheduling on a single batch processing machine. Journal of Scheduling, Vol. 13(2010), pp.629-638.

DOI: 10.1007/s10951-010-0180-2

Google Scholar

[3] F. Jolai: Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research, Vol. 162(2005), pp.184-190.

DOI: 10.1016/j.ejor.2003.10.011

Google Scholar

[4] S.V. Mehta and R. Uzsoy: Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, Vol. 30(1998), pp.165-178.

DOI: 10.1080/07408179808966448

Google Scholar

[5] I.C. Perez, J.W. Fowler and W.M. Carlyle: Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Computers and Operations Research, Vol. 32(2005), pp.327-341.

DOI: 10.1016/s0305-0548(03)00239-9

Google Scholar

[6] R. Uzsoy: Scheduling batch processing machines with incompatible job families. International Journal of Production Research, Vol. 33(1995), pp.2685-2708.

DOI: 10.1080/00207549508904839

Google Scholar

[7] G.C. Zhang, X.Q. Cai and C.K. Wong: On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, Vol. 48(2001), pp.241-258.

DOI: 10.1002/nav.5

Google Scholar