2012Management Science LettersOpen access

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

Hamidreza Haddad, Mohammadreza Nematollahi

Open full text 3 citations

Abstract

This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints.The primary objective of this paper is minimization of total weighted tardiness.Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model.The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time.Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters.Computational experiments validate the effectiveness and capability of proposed method.

Open-access reader

About this research paper

What this paper is about

This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints.The primary objective of this paper is minimization of total weighted tardiness.Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model.The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time.Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters.Computational experiments validate the effectiveness and capability of proposed method.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper tackles the single machine scheduling problem with dependent setup time and precedence constraints.The primary objective of this paper is minimization of total weighted tardiness.Since the complexity of the resulted problem is NP-hard we use metaheuristics method to solve the resulted model.The proposed model of this paper uses genetic algorithm to solve the problem in reasonable amount of time.Because of high sensitivity of GA to its initial values of parameters, a Taguchi approach is presented to calibrate its parameters.Computational experiments validate the effectiveness and capability of proposed method.

Key concepts: Tardiness, Single-machine scheduling, Computer science, Mathematical optimization, Taguchi methods, Scheduling (production processes), Minification, Metaheuristic

Related papers

Back to paper searchBrowse research topicsOriginal source
Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints — Research Paper | ScholarLens