The G-group heuristic for single machine lot scheduling
From MaRDI portal
Publication:3755218
DOI10.1080/00207548708919847zbMATH Open0618.90043OpenAlexW2006447476MaRDI QIDQ3755218FDOQ3755218
Publication date: 1987
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548708919847
Cites Work
- Title not available (Why is that?)
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
- On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
- Scheduling a Multi-Product Single Machine System
- The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
- Production Runs for Multiple Products: The Two-Product Heuristic
Cited In (12)
- The peak load minimization problem in cyclic production
- Hybrid genetic algorithm for the economic lot-scheduling problem
- The economic lot scheduling problem under extended basic period and power-of-two policy
- Heuristics for operator scheduling in group technology cells
- The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops
- The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
- The inventory replenishment planning and staggering problem: a bi-objective approach
- Title not available (Why is that?)
- The economic lot scheduling problem under power-of-two policy
- Solving the economic lot scheduling problem with multiple facilities in parallel using the time-varying lot sizes approach
- Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand
- The economic lot scheduling problem without capacity constraints
Recommendations
- Single machine group scheduling with ordered criteria π π
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs π π
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell π π
- The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops π π
- Single-machine group scheduling problems with variable job processing times π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: The G-group heuristic for single machine lot scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755218)