[article] 
inJournal of the operational research society (JORS) > Vol. 62 N° 8 (Août 2011) . - pp. 1555–1565

Titre :	Scheduling a single machine with multiple job processing ability to minimize makespan
Type de document :	texte imprimé
Auteurs :	X. Wang, Auteur ; Tang, L., Auteur
Année de publication :	2011
Article en page(s) :	pp. 1555–1565
Note générale :	Recherche opérationnelle
Langues :	Anglais (eng)
Mots-clés :	Single machine scheduling Multiple job processing ability Makespan Particle swarm optimization
Index. décimale :	001.424
Résumé :	This paper investigates a new problem, called single machine scheduling with multiple job processing ability, which is derived from the production of the continuous walking beaming reheating furnace in iron and steel industry. In this problem, there is no batch and the jobs enter and leave the machine one by one and continuously, which is different from general single machine batch scheduling problem where the jobs in a batch share the same start and departure time. Therefore, the start time and the departure time of a job depend on not only the job sequence but also the machine capacity. This problem is also different from the single semi-continuous batching machine scheduling recently studied in the literature, where the jobs are processed in batch mode and a new batch cannot be started for processing until the processing of the previous batch is completed though jobs in the same batch enter and leave the machine one by one. The objective of this problem is to minimize the makespan. We formulate this problem as a mixed integer linear programming model and propose a particle swarm optimization (PSO) algorithm for this problem. Computational results on randomly generated instances show that the proposed PSO algorithm is effective.
DEWEY :	001.424
ISSN :	0160-5682
En ligne :	http://www.palgrave-journals.com/jors/journal/v62/n8/abs/jors201088a.html

[article] Scheduling a single machine with multiple job processing ability to minimize makespan [texte imprimé] / X. Wang, Auteur ; Tang, L., Auteur . - 2011 . - pp. 1555–1565.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 8 (Août 2011) . - pp. 1555–1565

Mots-clés :	Single machine scheduling Multiple job processing ability Makespan Particle swarm optimization
Index. décimale :	001.424
Résumé :	This paper investigates a new problem, called single machine scheduling with multiple job processing ability, which is derived from the production of the continuous walking beaming reheating furnace in iron and steel industry. In this problem, there is no batch and the jobs enter and leave the machine one by one and continuously, which is different from general single machine batch scheduling problem where the jobs in a batch share the same start and departure time. Therefore, the start time and the departure time of a job depend on not only the job sequence but also the machine capacity. This problem is also different from the single semi-continuous batching machine scheduling recently studied in the literature, where the jobs are processed in batch mode and a new batch cannot be started for processing until the processing of the previous batch is completed though jobs in the same batch enter and leave the machine one by one. The objective of this problem is to minimize the makespan. We formulate this problem as a mixed integer linear programming model and propose a particle swarm optimization (PSO) algorithm for this problem. Computational results on randomly generated instances show that the proposed PSO algorithm is effective.
DEWEY :	001.424
ISSN :	0160-5682
En ligne :	http://www.palgrave-journals.com/jors/journal/v62/n8/abs/jors201088a.html