Optimal parallel machines scheduling with machine availability and eligibility constraints

Gwo Ji Sheen, Lu Wen Liao, Cheng Feng Lin

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of scheduling n non-preemptive and independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the maximum lateness. Each machine is capable of processing at specific availability intervals. We develop a branch and bound algorithm applying several immediate selection rules for solving this scheduling problem.

Original languageEnglish
Pages (from-to)132-139
Number of pages8
JournalInternational Journal of Advanced Manufacturing Technology
Volume36
Issue number1-2
DOIs
StatePublished - Feb 2008

Keywords

  • Availability constraint
  • Branch and bound algorithm
  • Eligibility constraint
  • Maximum lateness
  • Parallel machine scheduling

Fingerprint

Dive into the research topics of 'Optimal parallel machines scheduling with machine availability and eligibility constraints'. Together they form a unique fingerprint.

Cite this