Feasibility of Scheduling Lot Sizes of Three Products on One Machine
From MaRDI portal
Publication:4022912
DOI10.1287/MNSC.38.10.1482zbMATH Open0759.90044OpenAlexW2160532059MaRDI QIDQ4022912FDOQ4022912
Authors: C. A. Glass
Publication date: 17 January 1993
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.38.10.1482
Recommendations
- Feasibility of scheduling lot sizes of two frequencies on one machine
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
- Testing Feasibility in a Lot Scheduling Problem
- THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM
- scientific article; zbMATH DE number 90002
Cited In (10)
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
- New search algorithm for solving the maintenance scheduling problem for a family of machines
- Machining economics with machine interference considerations
- Feasibility of scheduling lot sizes of two frequencies on one machine
- THE BALANCED LOT SIZE FOR A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM
- Comments on the Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
- Perfect periodic scheduling for three basic cycles
- The use of genetic algorithms to solve the economic lot size scheduling problem
- The scheduling of maintenance service
- Application of ELSP solution techniques to the deterministic robotic scheduling problem
This page was built for publication: Feasibility of Scheduling Lot Sizes of Three Products on One Machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022912)