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

Melih Özlen; Scott Webster

doi:10.1080/00207540802446795

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

Melih Özlen, Scott Webster

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

6 Scopus citations

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 language	English (US)
Pages (from-to)	201-226
Number of pages	26
Journal	International Journal of Production Research
Volume	48
Issue number	1
DOIs	https://doi.org/10.1080/00207540802446795
State	Published - Jan 2010
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

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

Access to Document

10.1080/00207540802446795

Cite this

@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 = jan,

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

SN - 0020-7543

VL - 48

SP - 201

EP - 226

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 1

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this