Feasibility of scheduling lot sizes of two frequencies on one machine
type: Item
instance of: scholarly article
title: Feasibility of scheduling lot sizes of two frequencies on one machine
zbMATH Open document ID: 0819.90044
DOI: 10.1016/0377-2217(94)90080-9
author: C. A. Glass
published in: European Journal of Operational Research
publication date: 1994-08-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 622629
zbMATH Keywords: feasibility testing
zbMATH Keywords: economic lot scheduling
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90080-9
OpenAlex ID: W2084201959
cites work: A Dynamic Programming Approach to a Lot Size Scheduling Problem
cites work: Q3957935
cites work: The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
cites work: The Economic Lot Scheduling Problem (ELSP): Review and Extensions
cites work: Q3938812
cites work: `` Strong '' NP-Completeness Results
cites work: Feasibility of Scheduling Lot Sizes of Three Products on One Machine
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Q5724367
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
cites work: Q3940839
cites work: Q3818114
cites work: Algorithms for Scheduling Independent Tasks
cites work: On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
description: scientific article; zbMATH DE number 622629