A search heuristic for the sequence-dependent economic lot scheduling problem

DOI10.1016/S0377-2217(01)00265-XzbMath0998.90037MaRDI QIDQ1848619

Bret J. Wagner, Darwin J. Davis

Publication date: 13 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationheuristicstraveling salesmanscheduling theorylot sizing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

A common cycle approach for solving the economic lot and inspection scheduling problem ⋮ A profit-maximizing economic lot scheduling problem with price optimization ⋮ A scheduling policy for adjusting economic lot quantities to a feasible solution ⋮ Planning of multi-product pipelines by economic lot scheduling models ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ Economical production and transshipment policy for coordinating multiple production sites

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The use of genetic algorithms to solve the economic lot size scheduling problem
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
• Lot Sizing and Sequencing for N Products on One Facility
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A search heuristic for the sequence-dependent economic lot scheduling problem