A search heuristic for the sequence-dependent economic lot scheduling problem |
| |
Institution: | 1. Department of Engineering, St. Mary’s University, One Camino Santa Maria, San Antonio, TX 78228, United States;2. Industrial and Systems Engineering Department, CAIT, RUTCOR, Rutgers University, 96 Frelinghuysen Rd, Piscataway, NJ 08854, United States |
| |
Abstract: | Almost all of the research on the economic lot scheduling problem (ELSP) has assumed that setup times are sequence-independent even though sequence-dependent problems are common in practice. Furthermore, most of the solution approaches that have been developed solve for a single optimal schedule when in practice it is more important to provide managers with a range of schedules of different length and complexity. In this paper, we develop a heuristic procedure to solve the ELSP problem with sequence-dependent setups. The heuristic provides a range of solutions from which a manager can choose, which should prove useful in an actual stochastic production environment. We show that our heuristic can outperform Dobson's heuristic when the utilization is high and the sequence-dependent setup times and costs are significant. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|