Scheduling for parallel machines with different efficiencies

Yoshinari Yanagawa, Shigeji Miyazaki, Satoshi Hirakata, Nobuyuki Terado

Research output: Contribution to journalArticle

Abstract

This paper concerns a scheduling problem for parallel machines with different machining efficiencies. Each job has a common due date. Neither tardiness nor early shipping are allowed. Therefore, jobs completed early must be stored in the shop until the due date. Under these conditions the actual flow time of each job is measured from the starting time until the due date. The performance measure of schedules is the total actual flow time. An analytical procedure leads to some theorems to determine the assignment of jobs to each machine. An optimal algorithm based on these theorems is presented. A numerical example illustrates the procedure of the algorithm.

Original languageEnglish
Pages (from-to)1156-1162
Number of pages7
JournalNippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume62
Issue number595
DOIs
Publication statusPublished - Jan 1 1996

    Fingerprint

ASJC Scopus subject areas

  • Mechanics of Materials
  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Cite this