Abstract

We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. In the first problem (P1) we look at minimizing total completion time and number of tardy jobs for the two sets of jobs and present a forward SPT-EDD heuristic that attempts to generate the set of non-dominated solutions. The complexity of this specific problem is NP-hard; however some pseudo-polynomial algorithms have been suggested by earlier researchers and they have been used to compare the results from the proposed heuristic. In the second problem (P2) we look at minimizing total weighted completion time and maximum lateness. This is an established NP-hard problem for which we propose a forward WSPT-EDD heuristic that attempts to generate the set of supported points and compare our solution quality with MIP formulations. For both of these problems, we assume that all jobs are available at time zero and the jobs are not allowed to be preempted.

Original languageEnglish (US)
Pages (from-to)97-107
Number of pages11
JournalComputers and Operations Research
Volume45
DOIs
StatePublished - May 2014

Fingerprint

Single Machine Scheduling
Scheduling
Computational complexity
Heuristics
Bicriteria Scheduling
Polynomials
Total Weighted Completion Time
Maximum Lateness
Total Completion Time
Machine Scheduling
Nondominated Solutions
Polynomial Algorithm
Single Machine
NP-hard Problems
Performance Measures
Single machine scheduling
Scheduling Problem
Disjoint
NP-complete problem
Objective function

Keywords

  • Heuristic approaches
  • Interfering job sets
  • Mixed integer programming
  • Single machine scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modeling and Simulation

Cite this

Single machine scheduling with interfering job sets. / Khowala, Ketan; Fowler, John; Keha, Ahmet; Balasubramanian, Hari.

In: Computers and Operations Research, Vol. 45, 05.2014, p. 97-107.

Research output: Contribution to journalArticle

Khowala, Ketan ; Fowler, John ; Keha, Ahmet ; Balasubramanian, Hari. / Single machine scheduling with interfering job sets. In: Computers and Operations Research. 2014 ; Vol. 45. pp. 97-107.
@article{fdd5835598c843e99c60768bbcc147fb,
title = "Single machine scheduling with interfering job sets",
abstract = "We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. In the first problem (P1) we look at minimizing total completion time and number of tardy jobs for the two sets of jobs and present a forward SPT-EDD heuristic that attempts to generate the set of non-dominated solutions. The complexity of this specific problem is NP-hard; however some pseudo-polynomial algorithms have been suggested by earlier researchers and they have been used to compare the results from the proposed heuristic. In the second problem (P2) we look at minimizing total weighted completion time and maximum lateness. This is an established NP-hard problem for which we propose a forward WSPT-EDD heuristic that attempts to generate the set of supported points and compare our solution quality with MIP formulations. For both of these problems, we assume that all jobs are available at time zero and the jobs are not allowed to be preempted.",
keywords = "Heuristic approaches, Interfering job sets, Mixed integer programming, Single machine scheduling",
author = "Ketan Khowala and John Fowler and Ahmet Keha and Hari Balasubramanian",
year = "2014",
month = "5",
doi = "10.1016/j.cor.2013.10.012",
language = "English (US)",
volume = "45",
pages = "97--107",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Single machine scheduling with interfering job sets

AU - Khowala, Ketan

AU - Fowler, John

AU - Keha, Ahmet

AU - Balasubramanian, Hari

PY - 2014/5

Y1 - 2014/5

N2 - We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. In the first problem (P1) we look at minimizing total completion time and number of tardy jobs for the two sets of jobs and present a forward SPT-EDD heuristic that attempts to generate the set of non-dominated solutions. The complexity of this specific problem is NP-hard; however some pseudo-polynomial algorithms have been suggested by earlier researchers and they have been used to compare the results from the proposed heuristic. In the second problem (P2) we look at minimizing total weighted completion time and maximum lateness. This is an established NP-hard problem for which we propose a forward WSPT-EDD heuristic that attempts to generate the set of supported points and compare our solution quality with MIP formulations. For both of these problems, we assume that all jobs are available at time zero and the jobs are not allowed to be preempted.

AB - We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent's objective function is to be minimized. In the first problem (P1) we look at minimizing total completion time and number of tardy jobs for the two sets of jobs and present a forward SPT-EDD heuristic that attempts to generate the set of non-dominated solutions. The complexity of this specific problem is NP-hard; however some pseudo-polynomial algorithms have been suggested by earlier researchers and they have been used to compare the results from the proposed heuristic. In the second problem (P2) we look at minimizing total weighted completion time and maximum lateness. This is an established NP-hard problem for which we propose a forward WSPT-EDD heuristic that attempts to generate the set of supported points and compare our solution quality with MIP formulations. For both of these problems, we assume that all jobs are available at time zero and the jobs are not allowed to be preempted.

KW - Heuristic approaches

KW - Interfering job sets

KW - Mixed integer programming

KW - Single machine scheduling

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

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

U2 - 10.1016/j.cor.2013.10.012

DO - 10.1016/j.cor.2013.10.012

M3 - Article

VL - 45

SP - 97

EP - 107

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

ER -