Optimal solution and heuristic methods for earliness and tardiness production scheduling and planning problems

Aya Ishigaki, Shuhei Inada, Gilles Cormier, Yasuhiro Hirakawa

Research output: Contribution to journalArticle

Abstract

A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.

Original languageEnglish
Pages (from-to)321-329
Number of pages9
JournalJournal of Japan Industrial Management Association
Volume56
Issue number5
Publication statusPublished - 2005

Fingerprint

Earliness
Production/scheduling
Heuristic methods
Tardiness
Production Planning
Heuristic Method
Optimal Solution
Scheduling
Planning
Horizon
Partial
Decomposition
Branch and Bound Algorithm
Large-scale Problems
Decomposition Method
Divides
Numerical Experiment
Optimal solution
Production planning
Heuristics

Keywords

  • Branch and bound method
  • Decomposition heuristic method
  • Earliness and tardiness problem
  • Production scheduling and planning

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Applied Mathematics
  • Management Science and Operations Research
  • Strategy and Management

Cite this

Optimal solution and heuristic methods for earliness and tardiness production scheduling and planning problems. / Ishigaki, Aya; Inada, Shuhei; Cormier, Gilles; Hirakawa, Yasuhiro.

In: Journal of Japan Industrial Management Association, Vol. 56, No. 5, 2005, p. 321-329.

Research output: Contribution to journalArticle

@article{eb94aa106a844add85809f2c1805ce4b,
title = "Optimal solution and heuristic methods for earliness and tardiness production scheduling and planning problems",
abstract = "A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.",
keywords = "Branch and bound method, Decomposition heuristic method, Earliness and tardiness problem, Production scheduling and planning",
author = "Aya Ishigaki and Shuhei Inada and Gilles Cormier and Yasuhiro Hirakawa",
year = "2005",
language = "English",
volume = "56",
pages = "321--329",
journal = "Journal of Japan Industrial Management Association",
issn = "0386-4812",
publisher = "Nihon Keikei Kogakkai",
number = "5",

}

TY - JOUR

T1 - Optimal solution and heuristic methods for earliness and tardiness production scheduling and planning problems

AU - Ishigaki, Aya

AU - Inada, Shuhei

AU - Cormier, Gilles

AU - Hirakawa, Yasuhiro

PY - 2005

Y1 - 2005

N2 - A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.

AB - A demand-centred enumerating method with a branch and bound algorithm has been proposed for solving earliness and tardiness production scheduling and planning problems. This method can obtain an optimal solution for small-scale problems within a practical computation time. For larger-scale problems, a decomposition heuristic method has been proposed, which divides the problem into several partial problems in terms of the planning horizon. The partial problems are sequentially connected by the inventory at the end of the planning horizon. The validity of the optimal solution method and heuristic method is verified in a large-scale numerical experiment.

KW - Branch and bound method

KW - Decomposition heuristic method

KW - Earliness and tardiness problem

KW - Production scheduling and planning

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

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

M3 - Article

AN - SCOPUS:84864051527

VL - 56

SP - 321

EP - 329

JO - Journal of Japan Industrial Management Association

JF - Journal of Japan Industrial Management Association

SN - 0386-4812

IS - 5

ER -