Heuristic for scheduling on nonidentical machines to minimize tardy jobs

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. Each job consists of a single operation with different processing times depending on the capability of machines. The objective is to schedule the jobs in such a way that the number of tardy jobs is as small as possible. Among several scheduling objectives, minimizing tardy jobs considered in this paper is more important in a make-to-order manufacturing environment because the penalty cost of a job lies whether the job is late or not, rather than how late job is. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure between jobs and machines. A real life industrial application shows that the proposed algorithm is superior to the existing ones for the number of tardy jobs.

Original languageEnglish
Pages (from-to)188-194
Number of pages7
JournalInternational Journal of Industrial Engineering : Theory Applications and Practice
Volume7
Issue number3
Publication statusPublished - 2000 Sep 1

Fingerprint

Scheduling
Industrial applications
Processing
Costs

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

@article{af5af6089cac4f788679a86229351d92,
title = "Heuristic for scheduling on nonidentical machines to minimize tardy jobs",
abstract = "This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. Each job consists of a single operation with different processing times depending on the capability of machines. The objective is to schedule the jobs in such a way that the number of tardy jobs is as small as possible. Among several scheduling objectives, minimizing tardy jobs considered in this paper is more important in a make-to-order manufacturing environment because the penalty cost of a job lies whether the job is late or not, rather than how late job is. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure between jobs and machines. A real life industrial application shows that the proposed algorithm is superior to the existing ones for the number of tardy jobs.",
author = "Lee, {Hong Chul}",
year = "2000",
month = "9",
day = "1",
language = "English",
volume = "7",
pages = "188--194",
journal = "International Journal of Industrial Engineering : Theory Applications and Practice",
issn = "1072-4761",
publisher = "University of Cincinnati",
number = "3",

}

TY - JOUR

T1 - Heuristic for scheduling on nonidentical machines to minimize tardy jobs

AU - Lee, Hong Chul

PY - 2000/9/1

Y1 - 2000/9/1

N2 - This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. Each job consists of a single operation with different processing times depending on the capability of machines. The objective is to schedule the jobs in such a way that the number of tardy jobs is as small as possible. Among several scheduling objectives, minimizing tardy jobs considered in this paper is more important in a make-to-order manufacturing environment because the penalty cost of a job lies whether the job is late or not, rather than how late job is. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure between jobs and machines. A real life industrial application shows that the proposed algorithm is superior to the existing ones for the number of tardy jobs.

AB - This paper considers the nonidentical parallel machine scheduling problem in which n jobs having different due dates are to be scheduled on m nonidentical parallel machines. Each job consists of a single operation with different processing times depending on the capability of machines. The objective is to schedule the jobs in such a way that the number of tardy jobs is as small as possible. Among several scheduling objectives, minimizing tardy jobs considered in this paper is more important in a make-to-order manufacturing environment because the penalty cost of a job lies whether the job is late or not, rather than how late job is. The proposed algorithm makes use of the concept of assignment problem based on the suitability measure between jobs and machines. A real life industrial application shows that the proposed algorithm is superior to the existing ones for the number of tardy jobs.

UR - http://www.scopus.com/inward/record.url?scp=0034272950&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034272950&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034272950

VL - 7

SP - 188

EP - 194

JO - International Journal of Industrial Engineering : Theory Applications and Practice

JF - International Journal of Industrial Engineering : Theory Applications and Practice

SN - 1072-4761

IS - 3

ER -