Determining lot sizes and resource requirements: A review
Operations Research
Solving multi-item capacitated lot-sizing problems using variable redefinition
Operations Research
Capacitated lot sizing with setup times
Management Science
Solving multi-item lot-sizing problems using strong cutting planes
Management Science
Statistical search methods for lotsizing problems
Annals of Operations Research - Special issue on Tabu search
A Lagrange relaxation approach for very-large-scale capacitated lot-sizing
Management Science
Lot sizing in serial assembly systems with multiple constrained resources
Management Science
A heuristic method for lot-sizing in multi-stage systems
Computers and Operations Research
Discrete Lotsizing and Scheduling by Batch Sequencing
Management Science
Computers and Operations Research
Parallel Machine Scheduling by Column Generation
Operations Research
bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Management Science
Discrete lot sizing and scheduling using product decomposition into attributes
Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
A GA methodology for the scheduling of yarn-dyed textile production
Expert Systems with Applications: An International Journal
Integrating parts design characteristics and scheduling on parallel machines
Expert Systems with Applications: An International Journal
Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Genetic algorithm for rotary machine scheduling with dependent processing times
Journal of Intelligent Manufacturing
Hi-index | 0.01 |
This paper addresses a production scheduling problem in an injection molding facility. It appears to be the first attempt to schedule parallel machines for multiple items in presence of multiple capacitated resource constraints with sequence-dependent setup costs and times. The objective is to meet customer demands while minimizing the total inventory holding costs, backlogging costs and setup costs. We present a mathematical formulation of the problem. The computational complexity associated with the formulation makes it difficult for standard solvers address industrial-dimensioned problems in reasonable solution time. To overcome this, a two-phase workcenter-based decomposition scheme has been developed in this paper. The computational results for different problem sizes demonstrate that this scheme is able to solve industrial-dimensioned problems within reasonable time and accuracy.