Tabu search for a class of single-machine scheduling problems

U. Al-Turki; C. Fedjki; A. Andijani

doi:10.1016/S0305-0548(00)00036-8

Tabu search for a class of single-machine scheduling problems

U. Al-Turki, C. Fedjki, A. Andijani^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

52 Scopus citations

Abstract

In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.

Original language	English
Pages (from-to)	1223-1230
Number of pages	8
Journal	Computers and Operations Research
Volume	28
Issue number	12
DOIs	https://doi.org/10.1016/S0305-0548(00)00036-8
State	Published - Oct 2001

Bibliographical note

Funding Information:
The authors gratefully acknowledge the support of King Fahd University of Petroleum and Minerals.

Keywords

Scheduling
Tabu search
V-haped schedules
Variance minimization

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research

Access to Document

10.1016/S0305-0548(00)00036-8

Cite this

@article{f377bd3f6b19465e8a709cd5f77dfee3,

title = "Tabu search for a class of single-machine scheduling problems",

abstract = "In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.",

keywords = "Scheduling, Tabu search, V-haped schedules, Variance minimization",

author = "U. Al-Turki and C. Fedjki and A. Andijani",

note = "Funding Information: The authors gratefully acknowledge the support of King Fahd University of Petroleum and Minerals. ",

year = "2001",

month = oct,

doi = "10.1016/S0305-0548(00)00036-8",

language = "English",

volume = "28",

pages = "1223--1230",

journal = "Computers and Operations Research",

issn = "0305-0548",

number = "12",

}

TY - JOUR

T1 - Tabu search for a class of single-machine scheduling problems

AU - Al-Turki, U.

AU - Fedjki, C.

AU - Andijani, A.

N1 - Funding Information: The authors gratefully acknowledge the support of King Fahd University of Petroleum and Minerals.

PY - 2001/10

Y1 - 2001/10

N2 - In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.

AB - In this paper we develop a tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure. The performance of the developed algorithm is tested for solving the variance minimization problem. Problems from the literature are used to test the performance of the algorithm. This algorithm can be used for solving other problems such as minimizing completion time deviation from a common due date.

KW - Scheduling

KW - Tabu search

KW - V-haped schedules

KW - Variance minimization

UR - https://www.scopus.com/pages/publications/0035480298

U2 - 10.1016/S0305-0548(00)00036-8

DO - 10.1016/S0305-0548(00)00036-8

M3 - Article

AN - SCOPUS:0035480298

SN - 0305-0548

VL - 28

SP - 1223

EP - 1230

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 12

ER -

Tabu search for a class of single-machine scheduling problems

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this