Auction-based distributed scheduling in a dynamic job shop environment

Pooja Dewan, Sanjay B. Joshi

Research output: Contribution to journalArticle

47 Citations (Scopus)

Abstract

Developments in computing and communication technology coupled with the inability to address real-time issues in scheduling algorithms based on central control, has led to an interest in solving the problem of a distributed decision-making environment. This paper presents a new job shop formulation that schedules jobs using auctions for distributing control. A theoretical basis is presented for problem decomposition, bid construction, and bid evaluation for the auction using standard mathematical programming tools. Numerical results show that the auction-based approach outperforms the distributed dispatching approaches and can be used to create schedules for a wide range of scheduling objectives.

Original languageEnglish (US)
Pages (from-to)1173-1191
Number of pages19
JournalInternational Journal of Production Research
Volume40
Issue number5
DOIs
StatePublished - Mar 20 2002

Fingerprint

Scheduling
Mathematical programming
Scheduling algorithms
Decision making
Decomposition
Communication
Auctions
Job shop
Bid
Schedule
Evaluation
Dispatching
Communication technologies
Distributed decision making

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{5245f84cc73d40a08e4653c131e571e8,
title = "Auction-based distributed scheduling in a dynamic job shop environment",
abstract = "Developments in computing and communication technology coupled with the inability to address real-time issues in scheduling algorithms based on central control, has led to an interest in solving the problem of a distributed decision-making environment. This paper presents a new job shop formulation that schedules jobs using auctions for distributing control. A theoretical basis is presented for problem decomposition, bid construction, and bid evaluation for the auction using standard mathematical programming tools. Numerical results show that the auction-based approach outperforms the distributed dispatching approaches and can be used to create schedules for a wide range of scheduling objectives.",
author = "Pooja Dewan and Joshi, {Sanjay B.}",
year = "2002",
month = "3",
day = "20",
doi = "10.1080/00207540110098445",
language = "English (US)",
volume = "40",
pages = "1173--1191",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

Auction-based distributed scheduling in a dynamic job shop environment. / Dewan, Pooja; Joshi, Sanjay B.

In: International Journal of Production Research, Vol. 40, No. 5, 20.03.2002, p. 1173-1191.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Auction-based distributed scheduling in a dynamic job shop environment

AU - Dewan, Pooja

AU - Joshi, Sanjay B.

PY - 2002/3/20

Y1 - 2002/3/20

N2 - Developments in computing and communication technology coupled with the inability to address real-time issues in scheduling algorithms based on central control, has led to an interest in solving the problem of a distributed decision-making environment. This paper presents a new job shop formulation that schedules jobs using auctions for distributing control. A theoretical basis is presented for problem decomposition, bid construction, and bid evaluation for the auction using standard mathematical programming tools. Numerical results show that the auction-based approach outperforms the distributed dispatching approaches and can be used to create schedules for a wide range of scheduling objectives.

AB - Developments in computing and communication technology coupled with the inability to address real-time issues in scheduling algorithms based on central control, has led to an interest in solving the problem of a distributed decision-making environment. This paper presents a new job shop formulation that schedules jobs using auctions for distributing control. A theoretical basis is presented for problem decomposition, bid construction, and bid evaluation for the auction using standard mathematical programming tools. Numerical results show that the auction-based approach outperforms the distributed dispatching approaches and can be used to create schedules for a wide range of scheduling objectives.

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

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

U2 - 10.1080/00207540110098445

DO - 10.1080/00207540110098445

M3 - Article

AN - SCOPUS:0037139688

VL - 40

SP - 1173

EP - 1191

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 5

ER -