The general lotsizing and scheduling problem
type: Item
instance of: scholarly article
title: The general lotsizing and scheduling problem
zbMATH Open document ID: 0892.90055
DOI: 10.1007/BF01539800
author: Bernhard Fleischmann
author: H. Meyr
published in: OR Spektrum
publication date: 1998-08-03T00:00:00Z
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 1094846
zbMATH Keywords: general lotsizing and scheduling problem
zbMATH Keywords: local search
zbMATH Keywords: threshold accepting
zbMATH Keywords: heuristic
describes a project that uses: LINDO
MaRDI profile type: Publication
cites work: Studying the effects of production loss due to setup in dynamic production scheduling
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: The discrete lot-sizing and scheduling problem
cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
cites work: Q4198056
cites work: Lotsizing and scheduling for production planning
cites work: Capacitated lot-sizing with sequence dependent setup costs
cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
cites work: The Deterministic Dynamic Product Cycling Problem
cites work: Optimization by Simulated Annealing
cites work: An Efficient Algorithm for Multi-Item Scheduling
cites work: A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Deterministic lotsizing models for production planning
description: scientific article; zbMATH DE number 1094846