Feasibility of scheduling lot sizes of two frequencies on one machine
From MaRDI portal
Publication:1331610
DOI10.1016/0377-2217(94)90080-9zbMath0819.90044OpenAlexW2084201959MaRDI QIDQ1331610
Publication date: 21 August 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90080-9
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
The scheduling of maintenance service ⋮ Perfect periodic scheduling for three basic cycles ⋮ New search algorithm for solving the maintenance scheduling problem for a family of machines ⋮ On indexed data broadcast
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
- Feasibility of Scheduling Lot Sizes of Three Products on One Machine
- Algorithms for Scheduling Independent Tasks
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- `` Strong NP-Completeness Results
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Feasibility of scheduling lot sizes of two frequencies on one machine