Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
type: Item
instance of: scholarly article
title: Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
zbMATH Open document ID: 1193.90104
author: Taís M. Valeriano
author: Geraldo Robson Mateus
author: Martín Gómez Ravetti
author: Maurício C. de Souza
published in: Journal of Scheduling
publication date: 2010-07-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5760395
zbMATH Keywords: lot sizing
zbMATH Keywords: unrelated parallel machines scheduling
zbMATH Keywords: sequence dependent setup
zbMATH Keywords: changeover setup
describes a project that uses: MersenneTwister
MaRDI profile type: Publication
full work available at URL: s10951-009-0156-2
OpenAlex ID: W2092796159
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Single machine multi-product capacitated lot sizing with sequence-dependent setups
cites work: Q4365136
cites work: Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: Q4380372
cites work: Rolling-horizon lot-sizing when set-up times are sequence-dependent
cites work: Q4658190
cites work: A modified shifting bottleneck procedure for job-shop scheduling
cites work: Integration of lotsizing and scheduling decisions in a job-shop
cites work: Lot sizing and furnace scheduling in small foundries
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: Lot sizing and scheduling -- survey and extensions
cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
cites work: Greedy randomized adaptive search procedures
cites work: Solution approaches for the soft drink integrated production lot sizing and scheduling problem
cites work: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
cites work: The general lotsizing and scheduling problem
cites work: Capacitated lot-sizing with sequence dependent setup costs
cites work: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
cites work: Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
cites work: The Deterministic Dynamic Product Cycling Problem
cites work: An Integrated Model for Job-Shop Planning and Scheduling
cites work: Mersenne twister
cites work: Simultaneous lotsizing and scheduling on parallel machines
cites work: On the polyhedral structure of a multi-item production planning model with setup times
cites work: Q3525910
cites work: Planning and Scheduling in Manufacturing and Services
cites work: Q4735937
cites work: Production Planning by Mixed Integer Programming
cites work: A scheduling problem with unrelated parallel machines and sequence dependent setups
cites work: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
cites work: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
cites work: Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
cites work: Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
DOI: 10.1007/S10951-009-0156-2
description: scientific article; zbMATH DE number 5760395