Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
type: Item
instance of: scholarly article
title: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
zbMATH Open document ID: 1071.90529
author: Satyaki Ghosh Dastidar
author: Rakesh Nagi
published in: Computers \& Operations Research
publication date: 2005-06-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 2183207
zbMATH Keywords: Scheduling
zbMATH Keywords: Sequence-dependent setup
zbMATH Keywords: Changeover cost
zbMATH Keywords: Multiple capacitated resources
MaRDI profile type: Publication
full work available at URL: j.cor.2004.04.012
OpenAlex ID: W1987126439
cites work: Parallel machine scheduling by column generation
cites work: Q4365136
cites work: Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem
cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
cites work: Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Improved Heuristics for Multi-Stage Requirements Planning Systems
cites work: Rolling-horizon lot-sizing when set-up times are sequence-dependent
cites work: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: Lot sizing and scheduling -- survey and extensions
cites work: Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: The general lotsizing and scheduling problem
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: A heuristic method for lot-sizing in multi-stage systems
cites work: Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
cites work: Lot sizing in capacitated production planning and control systems
cites work: Discrete lotsizing and scheduling by batch sequencing
cites work: Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Simultaneous lotsizing and scheduling on parallel machines
cites work: A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
cites work: On the polyhedral structure of a multi-item production planning model with setup times
cites work: Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Statistical search methods for lotsizing problems
cites work: Deterministic lotsizing models for production planning
cites work: Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
cites work: A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
cites work: Dynamic version of the economic lot size model
DOI: 10.1016/J.COR.2004.04.012
description: scientific article; zbMATH DE number 2183207