Lot-sizing and scheduling for flexible flow lines.
type: Item
instance of: scholarly article
title: Lot-sizing and scheduling for flexible flow lines.
zbMATH Open document ID: 1098.90033
DOI: 10.1007/978-3-642-17101-7
author: Daniel Quadt
published in: Lecture Notes in Economics and Mathematical Systems
publication date: 2004-10-01T00:00:00Z
review text: In this book the lot-sizing and scheduling problem for flexible flow line production facilities is considered. Flexible flow lines are flow lines with parallel machines on some or all production stages. They can be found in a vast number of industries. The goal of a lot-sizing and scheduling routine is to determine production quantities, machine assignments and product sequences. The latter two represent a schedule, while the former are the result of a lot-sizing procedure. The author presents an integrative solution approach for the combined lot-sizing and scheduling problem. The objective is to minimize setup, inventory holding and back-order costs as well as mean flow time through the system. The solution approach consists of the phases `Bottleneck planning', `Schedule roll-out' and `Product-to-slot assignment'. The approach is bottleneck-oriented. A human planner is usually aware which production stage constitutes the bottleneck. If this is not the case, the bottleneck stage has to be determined beforehand. The first phase of the solution approach solves a single stage lot-sizing and scheduling problem on the bottleneck stage. Products are aggregated to product families. The suggested solution procedure is based on a new `heuristic' model formulation that uses integer variables in contrast to binary variables as employed by standard formulations. This makes it possible to solve the model to optimality or near-optimality using standard algorithms that are embedded in commercial software packages (e.g. CPLEX). The second phase generates a product family plan on all production stages. Thus, it keeps the aggregation level of product families, but explicitly includes the non-bottlenecks stages. It assigns a production time and a machine to each product family unit, which means that it solves a multi-stage scheduling and batching problem. The basic idea of the solution procedure is to establish the same product family throughput on all stages. In this way, each preced…
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 2104446
zbMATH Keywords: lot-sizing
zbMATH Keywords: scheduling problem
zbMATH Keywords: flexible flow lines
zbMATH Keywords: nested genetic algorithms
zbMATH Keywords: hierarchical production planning
zbMATH Keywords: rolling planning horizons
reviewed by: George S. Stavrakakis
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/978-3-642-17101-7
OpenAlex ID: W653996911
description: scientific article; zbMATH DE number 2104446