Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Intelligent Information Management

ISSN Print: 2160-5912
ISSN Online: 2160-5920
www.scirp.org/journal/iim
E-mail: iim@scirp.org

Google-based Impact Factor: 1.6
Citations h5-index & Ranking*

Journals Menu

"Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines"
written by P. Sivasankaran, T. Sornakumar, R. Panneerselvam,
published by Intelligent Information Management, Vol.2 No.3, 2010

has been cited by the following article(s):

Google Scholar
CrossRef

[1]	Parallel-machine scheduling problem: An experimental study of instances difficulty and algorithms performance
	2021

[2]	Auto-parametrização de meta-heurísticas para problemas de escalonamento em ambiente industrial
	2020

[3]	Insertion of new idle time for unrelated parallel machine scheduling with job splitting and machine breakdowns
	2020

[4]	Capacitated Santa Claus Problem
	2018

[5]	A Reinforcement Learning Approach for the Report Scheduling Process Under Multiple Constraints
	Progress in Artificial Intelligence and Pattern Recognition, 2018

[6]	Algoritmo para la optimización del proceso de secuenciación de reportes
	2018

[7]	ALGORITMO PARA LA OPTIMIZACIÓN DEL PROCESO DE SECUENCIACIÓN DE REPORTES ALGORITHM FOR THE OPTIMIZATION OF THE REPORT …
	2018

[8]	Pengembangan Algoritma Modified Longest Processing Time untuk Penyelesaian Masalah Penjadwalan n Pekerjaan m Mesin Paralel
	SEMINAR NASIONAL TEKNIK INDUSTRI UNIVERSITAS GADJAH MADA, 2017

[9]	Game Theory Based GT Heuristic Approach for Solving Job Shop Scheduling Problems
	2016

[10]	An ordered heuristic for the allocation of resources in unrelated parallel-machines
	International Journal of Industrial Engineering Computations, 2015

[11]	A NEIGHBORHOOD SEARCH TECHNIQUE FOR THE UNRELATED PARALLEL-MACHINES SCHEDULING
	Romanian Review Precision Mechanics, Optics & Mechatronics, 2015

[12]	An ordered approach to Minimum Completion Time in unrelated parallel-machines for the makespan optimization
	2014

[13]	Ordered minimum completion time heuristic for unrelated parallel-machines problems
	2014

[14]	An ordered approach to Minimum Completion Time in unrelated parallel-machines for the makespan optimization.
	2014

[1]	Insertion of new idle time for unrelated parallel machine scheduling with job splitting and machine breakdowns Computers & Industrial Engineering, 2020 DOI:10.1016/j.cie.2020.106630

[2]	An ordered approach to Minimum Completion Time in unrelated parallel-machines for the makespan optimization 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014), 2014 DOI:10.1109/NaBIC.2014.6921856

[3]	Ordered minimum completion time heuristic for unrelated parallel-machines problems 2014 9th Iberian Conference on Information Systems and Technologies (CISTI), 2014 DOI:10.1109/CISTI.2014.6876939

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Intelligent Information Management

Intelligent Information Management

Journals Menu

Home

About SCIRP

Service

Policies