A Swarm Intelligence Method Applied to Manufacturing Scheduling
A Swarm Intelligence Method Applied to Manufacturing Scheduling
Davide Anghinolfi, Antonio Boccalatte, Alberto Grosso, Massimo Paolucci, Andrea Passadore, Christian Vecchiola, DIST – Department of Communications Computer and System Sciences, University of Genova
STWTSDS problem. Regarding the latter point, note that the approach in [4] seems to be the only previous DPSO application to the single machine total weighted tardiness (STWT) problem. The rest of the paper is organized as follows. Section 2 introduces a formal problem definition and provides a general review of the relevant literature for it. Section 3 illustrates the basic aspects of the PSO algorithm, analysing in particular the DPSO approaches previously proposed in the literature. Section 4 then describes the proposed DPSO approach, discussing how it can be applied to the STWTSDS problem and highlighting the new features introduced. Section 5 presents the experimental campaign performed, which is mainly based on the benchmark set generated by Cicirello in [5] and available on the web. Finally, Section 6 draws some conclusions. II. THE STWTSDS PROBLEM The STWTSDS problem corresponds to the scheduling of n independent jobs on a single machine. All the jobs are released simultaneously, i.e., they are ready at time zero, the machine is continuously available and it can process only one job at a time. For each job j=1,..., n, the following quantities are given: a processing time pj, a due date dj and a weight wj. A sequence-dependent setup time sij must be waited before starting the processing of job j if it is immediately sequenced after job i. The tardiness of a job j is defined as Tj=max(0, Cjdj), being Cj the job j completion time. The scheduling objective is the minimization of the total weighted tardiness expressed as
Abstract—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent
Davide Anghinolfi, Antonio Boccalatte, Alberto Grosso, Massimo Paolucci, Andrea Passadore, Christian Vecchiola, DIST – Department of Communications Computer and System Sciences, University of Genova
STWTSDS problem. Regarding the latter point, note that the approach in [4] seems to be the only previous DPSO application to the single machine total weighted tardiness (STWT) problem. The rest of the paper is organized as follows. Section 2 introduces a formal problem definition and provides a general review of the relevant literature for it. Section 3 illustrates the basic aspects of the PSO algorithm, analysing in particular the DPSO approaches previously proposed in the literature. Section 4 then describes the proposed DPSO approach, discussing how it can be applied to the STWTSDS problem and highlighting the new features introduced. Section 5 presents the experimental campaign performed, which is mainly based on the benchmark set generated by Cicirello in [5] and available on the web. Finally, Section 6 draws some conclusions. II. THE STWTSDS PROBLEM The STWTSDS problem corresponds to the scheduling of n independent jobs on a single machine. All the jobs are released simultaneously, i.e., they are ready at time zero, the machine is continuously available and it can process only one job at a time. For each job j=1,..., n, the following quantities are given: a processing time pj, a due date dj and a weight wj. A sequence-dependent setup time sij must be waited before starting the processing of job j if it is immediately sequenced after job i. The tardiness of a job j is defined as Tj=max(0, Cjdj), being Cj the job j completion time. The scheduling objective is the minimization of the total weighted tardiness expressed as
Abstract—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent