The G-group heuristic for single machine lot scheduling
This paper develops a heuristic procedure for generating feasible solutions for the single-machine, multi-product, infinite-horizon, lot scheduling problem. This problem occurs in several practical situations, for example in metal stamping factories, on appliance assembly lines, in the beverage blending and bottling industries, in paint production and on motor car assembly lines. The proposed heuristic divides the N products into G groups and the products belonging to the same group are produced in the same cyclical pattern. Thus the problem of scheduling N independent products is reduced to that of scheduling G groups of products. Since G is much less than N, the problem is made simpler. The proposed heuristics has two main advantages: implementation facility and effectiveness. Computer codes are available for several mini and micro computers. The effectiveness is demonstrated by two tests. First, we solved the six problems originally solved by \textit{S. E. Elmaghraby} [Manage. Sci. 24, 587-598 (1978; Zbl 0376.90051)]. Obviously, the results based on only six problems, cannot be generalized. Second, the G-group heuristic, as well as five other heuristics, was applied to 270 random computer-generated problems. The results show that it performed better.
- The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops
- 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
- Grouping techniques for one machine scheduling subject to precedence constraints
- Single machine group scheduling with ordered criteria
- scientific article; zbMATH DE number 2219118
- Single-machine group scheduling problems with variable job processing times
- Single machine group scheduling problem with resource constraints setup and processing time
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
- scientific article; zbMATH DE number 3188105 (Why is no real title available?)
- On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
- Production Runs for Multiple Products: The Two-Product Heuristic
- Scheduling a Multi-Product Single Machine System
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
- The inventory replenishment planning and staggering problem: a bi-objective approach
- The economic lot scheduling problem without capacity constraints
- 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
- 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
- scientific article; zbMATH DE number 4152127 (Why is no real title available?)
- scientific article; zbMATH DE number 3947982 (Why is no real title available?)
- Product grouping for batch processes
- Hybrid genetic algorithm for the economic lot-scheduling problem
- scientific article; zbMATH DE number 834591 (Why is no real title available?)
- scientific article; zbMATH DE number 910793 (Why is no real title available?)
- The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
- The economic lot scheduling problem under power-of-two policy
- The peak load minimization problem in cyclic production
- The economic lot scheduling problem under extended basic period and power-of-two policy
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)