Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs

Melih Özlen, Scott Webster

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This study considers the flow-time minimisation problem on two identical parallel machines, where the machines are subject to planned downtimes. Jobs that are interrupted due to machine downtimes may resume processing once the machine becomes available without incurring additional costs or setup times. We identify optimality properties, develop upper and lower bounding procedures, and present a branch and bound methodology based on the proposed properties and bounds. The computational efficiency is tested on problem instances with up to 35 jobs.

Original languageEnglish (US)
Pages (from-to)201-226
Number of pages26
JournalInternational Journal of Production Research
Volume48
Issue number1
DOIs
StatePublished - Jan 2010
Externally publishedYes

Fingerprint

Computational efficiency
Processing
Costs
Flow time
Parallel machines

Keywords

  • Flow-time
  • Identical parallel machines
  • Planned downtimes
  • Pre-emption
  • Scheduling

ASJC Scopus subject areas

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

Cite this

Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs. / Özlen, Melih; Webster, Scott.

In: International Journal of Production Research, Vol. 48, No. 1, 01.2010, p. 201-226.

Research output: Contribution to journalArticle

@article{ee8f519dd326442abd720966df190bed,
title = "Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs",
abstract = "This study considers the flow-time minimisation problem on two identical parallel machines, where the machines are subject to planned downtimes. Jobs that are interrupted due to machine downtimes may resume processing once the machine becomes available without incurring additional costs or setup times. We identify optimality properties, develop upper and lower bounding procedures, and present a branch and bound methodology based on the proposed properties and bounds. The computational efficiency is tested on problem instances with up to 35 jobs.",
keywords = "Flow-time, Identical parallel machines, Planned downtimes, Pre-emption, Scheduling",
author = "Melih {\"O}zlen and Scott Webster",
year = "2010",
month = "1",
doi = "10.1080/00207540802446795",
language = "English (US)",
volume = "48",
pages = "201--226",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

TY - JOUR

T1 - Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs

AU - Özlen, Melih

AU - Webster, Scott

PY - 2010/1

Y1 - 2010/1

N2 - This study considers the flow-time minimisation problem on two identical parallel machines, where the machines are subject to planned downtimes. Jobs that are interrupted due to machine downtimes may resume processing once the machine becomes available without incurring additional costs or setup times. We identify optimality properties, develop upper and lower bounding procedures, and present a branch and bound methodology based on the proposed properties and bounds. The computational efficiency is tested on problem instances with up to 35 jobs.

AB - This study considers the flow-time minimisation problem on two identical parallel machines, where the machines are subject to planned downtimes. Jobs that are interrupted due to machine downtimes may resume processing once the machine becomes available without incurring additional costs or setup times. We identify optimality properties, develop upper and lower bounding procedures, and present a branch and bound methodology based on the proposed properties and bounds. The computational efficiency is tested on problem instances with up to 35 jobs.

KW - Flow-time

KW - Identical parallel machines

KW - Planned downtimes

KW - Pre-emption

KW - Scheduling

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

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

U2 - 10.1080/00207540802446795

DO - 10.1080/00207540802446795

M3 - Article

AN - SCOPUS:74549146176

VL - 48

SP - 201

EP - 226

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 1

ER -