Lot-sizing and scheduling problem with earliness tardiness and setup penalties

Authors:
Wisut Supithak;Surya D. Liman;Elliot J. Montes
Affiliations:
Department of Industrial Engineering, Faculty of Engineering, Kasetsart University, 50 Paholyothin Road, Jatujak, BKK 10900, Thailand;Department of Industrial Engineering, Faculty of Engineering, Texas Tech University, 2500 Broadway, Lubbock, TX 79409, USA;Department of Industrial Engineering, Faculty of Engineering, Texas Tech University, 2500 Broadway, Lubbock, TX 79409, USA
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 6
Cited 3

Determining lot sizes and resource requirements: A review

Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Some extensions of the discrete lotsizing and scheduling problem

Management Science
A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times

Management Science
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
Discrete Lotsizing and Scheduling by Batch Sequencing

Management Science

A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm

Engineering Applications of Artificial Intelligence
Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of determining the production lot sizes and their schedules so that the sum of setup cost, holding cost, and tardy cost is minimized. There are n orders waiting to be processed. Each order has its own due date, earliness penalty and tardiness penalty. The production is done in lots, which is the manufacturing of the same product continuously. No early delivery is allowed. Each order is delivered once, on the due date or immediately after the production of the order is completed. We present an algorithm, based on the use of the assignment problem, to optimally solve the problem with zero setup cost. For the problem with setup cost, the Backward Search algorithm is proposed to solve the small size problem. To deal with the large size problem, two heuristics which are Sequencing with Optimal Timing and Genetic Algorithm are presented.