Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

Authors:
Sungmin Kang;Kavindra Malik;L. Joseph Thomas
Affiliations:
-;-;-
Venue:
Management Science
Year:
1999

Citing 0
Cited 8

Optimizing plant-line schedules and an application at Hidden Valley manufacturing company

Interfaces
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times

Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes

Computers and Operations Research
Parallel genetic algorithm approaches applied to solve a synchronized and integrated lot sizing and scheduling problem

Proceedings of the 2010 ACM Symposium on Applied Computing
OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing

Operations Research
A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs

Computers and Industrial Engineering
Simultaneous batch splitting and scheduling on identical parallel production lines

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Industrial lotsizing and scheduling pose very difficult analytical problems. We propose an unconventional model that deals with sequence-dependent setup costs in a multiple-machine environment. The sequence-splitting model splits an entire schedule into subsequences, leading to tractable subproblems. An optimization approach based on a column generation/branch and bound methodology is developed, and heuristically adapted to test problems including five real-world problem instances gathered from industry.