Scheduling for parallel machines with different efficiencies

Yoshinari Yanagawa; Shigeji Miyazaki; Satoshi Hirakata; Nobuyuki Terado

doi:10.1299/kikaic.62.1156

Scheduling for parallel machines with different efficiencies

Yoshinari Yanagawa, Shigeji Miyazaki, Satoshi Hirakata, Nobuyuki Terado

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

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 language	English
Pages (from-to)	1156-1162
Number of pages	7
Journal	Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume	62
Issue number	595
DOIs	https://doi.org/10.1299/kikaic.62.1156
Publication status	Published - 1996
Externally published	Yes

ASJC Scopus subject areas

Mechanics of Materials
Mechanical Engineering
Industrial and Manufacturing Engineering

Access to Document

10.1299/kikaic.62.1156

Cite this

@article{038b17f4ac4e493fa4cd0e4c0c5fb3f4,

title = "Scheduling for parallel machines with different efficiencies",

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.",

author = "Yoshinari Yanagawa and Shigeji Miyazaki and Satoshi Hirakata and Nobuyuki Terado",

year = "1996",

doi = "10.1299/kikaic.62.1156",

language = "English",

volume = "62",

pages = "1156--1162",

journal = "Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C",

issn = "0387-5024",

publisher = "Japan Society of Mechanical Engineers",

number = "595",

}

TY - JOUR

T1 - Scheduling for parallel machines with different efficiencies

AU - Yanagawa, Yoshinari

AU - Miyazaki, Shigeji

AU - Hirakata, Satoshi

AU - Terado, Nobuyuki

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

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

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

U2 - 10.1299/kikaic.62.1156

DO - 10.1299/kikaic.62.1156

M3 - Article

AN - SCOPUS:0030100888

SN - 0387-5024

VL - 62

SP - 1156

EP - 1162

JO - Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

JF - Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

IS - 595

ER -

Scheduling for parallel machines with different efficiencies

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this