Maximize profit in two-stage flow shop scheduling

Noriya Kayaki, Yoshinari Yanagawa, Shigeji Miyazaki

Research output: Contribution to journalArticle

Abstract

This paper presents a scheduling method to maximize total profit as a performance measure in a two stage flow shop model. The profit is defined as the difference between the revenue and the cost of production, and a scheduling method to maximize total profit is proposed using the Branch and Bound method aiming at maximizing revenue and minimizing costs. This paper compares the optimal schedule which maximize total profit with the optimal schedule which minimize total flow time searched by Johnson's theory. This paper also shows the usefulness and some characteristics of the proposed method through various numerical experiments.

Original languageEnglish
Pages (from-to)2502-2509
Number of pages8
JournalNihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume68
Issue number8
Publication statusPublished - Aug 2002
Externally publishedYes

Fingerprint

Profitability
Scheduling
Branch and bound method
Costs
Experiments

Keywords

  • Branch and Bound Method
  • Flow Shop Scheduling
  • Maximize Total Profit
  • Process Planning
  • Production Management
  • Production Planning

ASJC Scopus subject areas

  • Mechanical Engineering

Cite this

Maximize profit in two-stage flow shop scheduling. / Kayaki, Noriya; Yanagawa, Yoshinari; Miyazaki, Shigeji.

In: Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, Vol. 68, No. 8, 08.2002, p. 2502-2509.

Research output: Contribution to journalArticle

@article{547b60b67a9942f1bdf5683b0cd6aee7,
title = "Maximize profit in two-stage flow shop scheduling",
abstract = "This paper presents a scheduling method to maximize total profit as a performance measure in a two stage flow shop model. The profit is defined as the difference between the revenue and the cost of production, and a scheduling method to maximize total profit is proposed using the Branch and Bound method aiming at maximizing revenue and minimizing costs. This paper compares the optimal schedule which maximize total profit with the optimal schedule which minimize total flow time searched by Johnson's theory. This paper also shows the usefulness and some characteristics of the proposed method through various numerical experiments.",
keywords = "Branch and Bound Method, Flow Shop Scheduling, Maximize Total Profit, Process Planning, Production Management, Production Planning",
author = "Noriya Kayaki and Yoshinari Yanagawa and Shigeji Miyazaki",
year = "2002",
month = "8",
language = "English",
volume = "68",
pages = "2502--2509",
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 = "8",

}

TY - JOUR

T1 - Maximize profit in two-stage flow shop scheduling

AU - Kayaki, Noriya

AU - Yanagawa, Yoshinari

AU - Miyazaki, Shigeji

PY - 2002/8

Y1 - 2002/8

N2 - This paper presents a scheduling method to maximize total profit as a performance measure in a two stage flow shop model. The profit is defined as the difference between the revenue and the cost of production, and a scheduling method to maximize total profit is proposed using the Branch and Bound method aiming at maximizing revenue and minimizing costs. This paper compares the optimal schedule which maximize total profit with the optimal schedule which minimize total flow time searched by Johnson's theory. This paper also shows the usefulness and some characteristics of the proposed method through various numerical experiments.

AB - This paper presents a scheduling method to maximize total profit as a performance measure in a two stage flow shop model. The profit is defined as the difference between the revenue and the cost of production, and a scheduling method to maximize total profit is proposed using the Branch and Bound method aiming at maximizing revenue and minimizing costs. This paper compares the optimal schedule which maximize total profit with the optimal schedule which minimize total flow time searched by Johnson's theory. This paper also shows the usefulness and some characteristics of the proposed method through various numerical experiments.

KW - Branch and Bound Method

KW - Flow Shop Scheduling

KW - Maximize Total Profit

KW - Process Planning

KW - Production Management

KW - Production Planning

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

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

M3 - Article

AN - SCOPUS:0036702205

VL - 68

SP - 2502

EP - 2509

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

SN - 0387-5024

IS - 8

ER -