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

Melih Özlen, Scott Webster

Research output: Contribution to journalArticle

5 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 languageEnglish (US)
Pages (from-to)201-226
Number of pages26
JournalInternational Journal of Production Research
Volume48
Issue number1
DOIs
StatePublished - Jan 1 2010
Externally publishedYes

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

Fingerprint Dive into the research topics of 'Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs'. Together they form a unique fingerprint.

  • Cite this