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 Dec 1

Keywords

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Optimal solution and heuristic methods for earliness and tardiness production scheduling and planning problems'. Together they form a unique fingerprint.

  • Cite this